/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/mutex_lock_int.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 19:00:38,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 19:00:38,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 19:00:38,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 19:00:38,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 19:00:38,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 19:00:38,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 19:00:38,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 19:00:38,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 19:00:38,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 19:00:38,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 19:00:38,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 19:00:38,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 19:00:38,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 19:00:38,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 19:00:38,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 19:00:38,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 19:00:38,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 19:00:38,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 19:00:38,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 19:00:38,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 19:00:38,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 19:00:38,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 19:00:38,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 19:00:38,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 19:00:38,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 19:00:38,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 19:00:38,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 19:00:38,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 19:00:38,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 19:00:38,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 19:00:38,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 19:00:38,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 19:00:38,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 19:00:38,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 19:00:38,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 19:00:38,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 19:00:38,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 19:00:38,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 19:00:38,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 19:00:38,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 19:00:38,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 19:00:38,596 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 19:00:38,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 19:00:38,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 19:00:38,598 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 19:00:38,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 19:00:38,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 19:00:38,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 19:00:38,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 19:00:38,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 19:00:38,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 19:00:38,600 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 19:00:38,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 19:00:38,601 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 19:00:38,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 19:00:38,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 19:00:38,602 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 19:00:38,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 19:00:38,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 19:00:38,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:00:38,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 19:00:38,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 19:00:38,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 19:00:38,603 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 19:00:38,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 19:00:38,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 19:00:38,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 19:00:38,911 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 19:00:38,911 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 19:00:38,912 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/mutex_lock_int.c_1.i [2020-07-10 19:00:38,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f9c2eb1/1e61ac477b2c41ad8d913ffd4c251449/FLAG201ef369c [2020-07-10 19:00:39,405 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 19:00:39,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/mutex_lock_int.c_1.i [2020-07-10 19:00:39,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f9c2eb1/1e61ac477b2c41ad8d913ffd4c251449/FLAG201ef369c [2020-07-10 19:00:39,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f9c2eb1/1e61ac477b2c41ad8d913ffd4c251449 [2020-07-10 19:00:39,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 19:00:39,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 19:00:39,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 19:00:39,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 19:00:39,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 19:00:39,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:00:39" (1/1) ... [2020-07-10 19:00:39,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4865d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:39, skipping insertion in model container [2020-07-10 19:00:39,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 07:00:39" (1/1) ... [2020-07-10 19:00:39,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 19:00:39,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 19:00:40,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:00:40,032 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 19:00:40,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 19:00:40,066 INFO L208 MainTranslator]: Completed translation [2020-07-10 19:00:40,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40 WrapperNode [2020-07-10 19:00:40,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 19:00:40,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 19:00:40,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 19:00:40,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 19:00:40,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... [2020-07-10 19:00:40,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 19:00:40,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 19:00:40,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 19:00:40,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 19:00:40,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2020-07-10 19:00:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure err [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 19:00:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 19:00:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 19:00:40,536 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 19:00:40,537 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 19:00:40,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:00:40 BoogieIcfgContainer [2020-07-10 19:00:40,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 19:00:40,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 19:00:40,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 19:00:40,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 19:00:40,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 07:00:39" (1/3) ... [2020-07-10 19:00:40,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c41017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:00:40, skipping insertion in model container [2020-07-10 19:00:40,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 07:00:40" (2/3) ... [2020-07-10 19:00:40,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c41017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 07:00:40, skipping insertion in model container [2020-07-10 19:00:40,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 07:00:40" (3/3) ... [2020-07-10 19:00:40,549 INFO L109 eAbstractionObserver]: Analyzing ICFG mutex_lock_int.c_1.i [2020-07-10 19:00:40,560 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 19:00:40,569 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 19:00:40,593 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 19:00:40,624 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 19:00:40,624 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 19:00:40,624 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 19:00:40,624 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 19:00:40,625 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 19:00:40,625 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 19:00:40,625 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 19:00:40,625 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 19:00:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-10 19:00:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 19:00:40,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:40,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:00:40,649 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:40,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1355543847, now seen corresponding path program 1 times [2020-07-10 19:00:40,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:40,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733928243] [2020-07-10 19:00:40,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:40,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-10 19:00:40,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-10 19:00:40,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-10 19:00:40,970 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 19:00:40,971 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {42#true} {42#true} #48#return; {42#true} is VALID [2020-07-10 19:00:40,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:00:40,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {53#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {42#true} is VALID [2020-07-10 19:00:40,975 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#true} #valid := #valid[0 := 0]; {42#true} is VALID [2020-07-10 19:00:40,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#true} assume 0 < #StackHeapBarrier; {42#true} is VALID [2020-07-10 19:00:40,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#true} assume true; {42#true} is VALID [2020-07-10 19:00:40,977 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#true} {42#true} #48#return; {42#true} is VALID [2020-07-10 19:00:40,977 INFO L263 TraceCheckUtils]: 6: Hoare triple {42#true} call #t~ret2 := main(); {42#true} is VALID [2020-07-10 19:00:40,978 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#true} SUMMARY for call ~#m~0.base, ~#m~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {42#true} is VALID [2020-07-10 19:00:40,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#true} SUMMARY for call write~int(0, ~#m~0.base, ~#m~0.offset, 4); srcloc: L30 {49#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-10 19:00:40,981 INFO L263 TraceCheckUtils]: 9: Hoare triple {49#(= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} call mutex_lock(~#m~0.base, ~#m~0.offset); {50#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 0)} is VALID [2020-07-10 19:00:40,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 0)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {51#(= 0 (select (select |#memory_int| mutex_lock_~a.base) mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:40,984 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#(= 0 (select (select |#memory_int| mutex_lock_~a.base) mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {52#(= 0 |mutex_lock_#t~mem0|)} is VALID [2020-07-10 19:00:40,985 INFO L280 TraceCheckUtils]: 12: Hoare triple {52#(= 0 |mutex_lock_#t~mem0|)} assume 1 == #t~mem0; {43#false} is VALID [2020-07-10 19:00:40,986 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#false} havoc #t~mem0; {43#false} is VALID [2020-07-10 19:00:40,986 INFO L263 TraceCheckUtils]: 14: Hoare triple {43#false} call err(); {43#false} is VALID [2020-07-10 19:00:40,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#false} assume !false; {43#false} is VALID [2020-07-10 19:00:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:00:40,990 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:40,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733928243] [2020-07-10 19:00:41,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:41,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 19:00:41,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224051561] [2020-07-10 19:00:41,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 19:00:41,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:41,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 19:00:41,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:41,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 19:00:41,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 19:00:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 19:00:41,060 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 7 states. [2020-07-10 19:00:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:41,644 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 19:00:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 19:00:41,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 19:00:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:00:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-10 19:00:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 19:00:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2020-07-10 19:00:41,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2020-07-10 19:00:41,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:41,768 INFO L225 Difference]: With dead ends: 60 [2020-07-10 19:00:41,768 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 19:00:41,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-10 19:00:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 19:00:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 19:00:41,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:41,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 19:00:41,848 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 19:00:41,848 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 19:00:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:41,852 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 19:00:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 19:00:41,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:41,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:41,853 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 19:00:41,854 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 19:00:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:41,857 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 19:00:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 19:00:41,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:41,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:41,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:41,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 19:00:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2020-07-10 19:00:41,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 16 [2020-07-10 19:00:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:41,863 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2020-07-10 19:00:41,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 19:00:41,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 24 transitions. [2020-07-10 19:00:41,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 19:00:41,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 19:00:41,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 19:00:41,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 19:00:41,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 19:00:41,902 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 19:00:41,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 19:00:41,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1044574925, now seen corresponding path program 1 times [2020-07-10 19:00:41,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 19:00:41,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [813565233] [2020-07-10 19:00:41,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 19:00:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:42,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {282#true} is VALID [2020-07-10 19:00:42,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} #valid := #valid[0 := 0]; {282#true} is VALID [2020-07-10 19:00:42,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 19:00:42,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 19:00:42,042 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-10 19:00:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 19:00:42,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} assume !(1 == #t~mem0); {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} havoc #t~mem0; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call write~int(1, ~a.base, ~a.offset, 4); srcloc: L18-6 {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-10 19:00:42,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} assume true; {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-10 19:00:42,136 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} {282#true} #52#return; {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-10 19:00:42,138 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 19:00:42,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {282#true} is VALID [2020-07-10 19:00:42,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {282#true} #valid := #valid[0 := 0]; {282#true} is VALID [2020-07-10 19:00:42,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {282#true} assume 0 < #StackHeapBarrier; {282#true} is VALID [2020-07-10 19:00:42,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 19:00:42,140 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-10 19:00:42,140 INFO L263 TraceCheckUtils]: 6: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-10 19:00:42,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {282#true} SUMMARY for call ~#m~0.base, ~#m~0.offset := #Ultimate.allocOnStack(4); srcloc: mainENTRY {282#true} is VALID [2020-07-10 19:00:42,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {282#true} SUMMARY for call write~int(0, ~#m~0.base, ~#m~0.offset, 4); srcloc: L30 {282#true} is VALID [2020-07-10 19:00:42,142 INFO L263 TraceCheckUtils]: 9: Hoare triple {282#true} call mutex_lock(~#m~0.base, ~#m~0.offset); {301#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 19:00:42,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {301#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,144 INFO L280 TraceCheckUtils]: 11: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call #t~mem0 := read~int(~a.base, ~a.offset, 4); srcloc: L18 {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} assume !(1 == #t~mem0); {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,146 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} havoc #t~mem0; {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2020-07-10 19:00:42,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {302#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} SUMMARY for call write~int(1, ~a.base, ~a.offset, 4); srcloc: L18-6 {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-10 19:00:42,148 INFO L280 TraceCheckUtils]: 15: Hoare triple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} assume true; {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} is VALID [2020-07-10 19:00:42,150 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {303#(= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1)} {282#true} #52#return; {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} is VALID [2020-07-10 19:00:42,154 INFO L263 TraceCheckUtils]: 17: Hoare triple {296#(= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|))} call mutex_unlock(~#m~0.base, ~#m~0.offset); {297#(= (select (select |#memory_int| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|) 1)} is VALID [2020-07-10 19:00:42,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {297#(= (select (select |#memory_int| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|) 1)} ~b.base, ~b.offset := #in~b.base, #in~b.offset; {298#(= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset))} is VALID [2020-07-10 19:00:42,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {298#(= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset, 4); srcloc: L24 {299#(= 1 |mutex_unlock_#t~mem1|)} is VALID [2020-07-10 19:00:42,157 INFO L280 TraceCheckUtils]: 20: Hoare triple {299#(= 1 |mutex_unlock_#t~mem1|)} assume 1 != #t~mem1; {283#false} is VALID [2020-07-10 19:00:42,158 INFO L280 TraceCheckUtils]: 21: Hoare triple {283#false} havoc #t~mem1; {283#false} is VALID [2020-07-10 19:00:42,158 INFO L263 TraceCheckUtils]: 22: Hoare triple {283#false} call err(); {283#false} is VALID [2020-07-10 19:00:42,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 19:00:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 19:00:42,162 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 19:00:42,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [813565233] [2020-07-10 19:00:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 19:00:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 19:00:42,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151361556] [2020-07-10 19:00:42,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 19:00:42,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 19:00:42,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 19:00:42,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:42,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 19:00:42,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 19:00:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 19:00:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-10 19:00:42,201 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 10 states. [2020-07-10 19:00:42,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:42,756 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 19:00:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 19:00:42,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 19:00:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 19:00:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:00:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-07-10 19:00:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 19:00:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2020-07-10 19:00:42,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2020-07-10 19:00:42,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:42,807 INFO L225 Difference]: With dead ends: 25 [2020-07-10 19:00:42,807 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 19:00:42,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-10 19:00:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 19:00:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 19:00:42,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 19:00:42,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 19:00:42,810 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:00:42,810 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:00:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:42,810 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:00:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:00:42,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:42,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:42,811 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 19:00:42,811 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 19:00:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 19:00:42,812 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 19:00:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:00:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:42,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 19:00:42,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 19:00:42,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 19:00:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 19:00:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 19:00:42,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-10 19:00:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 19:00:42,814 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 19:00:42,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 19:00:42,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 19:00:42,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 19:00:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 19:00:42,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 19:00:42,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 19:00:42,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 19:00:43,270 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (and (= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset)) (= |#memory_int| |old(#memory_int)|)) (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|)))) [2020-07-10 19:00:43,271 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) (and (= 1 |mutex_unlock_#t~mem1|) (= 1 (select (select |#memory_int| mutex_unlock_~b.base) mutex_unlock_~b.offset)) (= |#memory_int| |old(#memory_int)|))) [2020-07-10 19:00:43,271 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) [2020-07-10 19:00:43,271 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) [2020-07-10 19:00:43,271 INFO L271 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: true [2020-07-10 19:00:43,271 INFO L271 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L264 CegarLoopResult]: At program point mutex_unlockENTRY(lines 22 26) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) |mutex_unlock_#in~b.offset|))) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 19:00:43,272 INFO L271 CegarLoopResult]: At program point mutex_unlockEXIT(lines 22 26) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L271 CegarLoopResult]: At program point mutex_unlockFINAL(lines 22 26) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,272 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 19:00:43,273 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,273 INFO L271 CegarLoopResult]: At program point errErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: true [2020-07-10 19:00:43,273 INFO L271 CegarLoopResult]: At program point errEXIT(lines 13 14) the Hoare annotation is: true [2020-07-10 19:00:43,273 INFO L271 CegarLoopResult]: At program point errENTRY(lines 13 14) the Hoare annotation is: true [2020-07-10 19:00:43,273 INFO L271 CegarLoopResult]: At program point errFINAL(lines 13 14) the Hoare annotation is: true [2020-07-10 19:00:43,274 INFO L264 CegarLoopResult]: At program point mutex_lockENTRY(lines 16 20) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,274 INFO L264 CegarLoopResult]: At program point mutex_lockEXIT(lines 16 20) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,274 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,274 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= 0 |mutex_lock_#t~mem0|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,274 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) [2020-07-10 19:00:43,275 INFO L264 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) [2020-07-10 19:00:43,275 INFO L264 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= 0 |mutex_lock_#t~mem0|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,275 INFO L264 CegarLoopResult]: At program point L18-6(line 18) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,275 INFO L264 CegarLoopResult]: At program point mutex_lockFINAL(lines 16 20) the Hoare annotation is: (or (and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|) 1) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset)) (not (= 0 (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)))) [2020-07-10 19:00:43,275 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,275 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,276 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,276 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 19:00:43,276 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (= 1 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) [2020-07-10 19:00:43,276 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (= 0 (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) [2020-07-10 19:00:43,276 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-10 19:00:43,276 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 28 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-10 19:00:43,277 INFO L271 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: true [2020-07-10 19:00:43,277 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 28 40) the Hoare annotation is: true [2020-07-10 19:00:43,277 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 28 40) the Hoare annotation is: true [2020-07-10 19:00:43,277 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-10 19:00:43,298 INFO L163 areAnnotationChecker]: CFG has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 19:00:43,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:00:43,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:00:43,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 07:00:43 BoogieIcfgContainer [2020-07-10 19:00:43,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 19:00:43,315 INFO L168 Benchmark]: Toolchain (without parser) took 3509.49 ms. Allocated memory was 135.8 MB in the beginning and 251.7 MB in the end (delta: 115.9 MB). Free memory was 101.5 MB in the beginning and 217.0 MB in the end (delta: -115.5 MB). Peak memory consumption was 365.1 kB. Max. memory is 7.1 GB. [2020-07-10 19:00:43,316 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 19:00:43,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.19 ms. Allocated memory is still 135.8 MB. Free memory was 101.1 MB in the beginning and 91.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:43,317 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 135.8 MB. Free memory was 91.3 MB in the beginning and 89.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:43,318 INFO L168 Benchmark]: RCFGBuilder took 439.52 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.5 MB in the beginning and 160.2 MB in the end (delta: -70.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 19:00:43,319 INFO L168 Benchmark]: TraceAbstraction took 2769.76 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 160.2 MB in the beginning and 217.0 MB in the end (delta: -56.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 19:00:43,322 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.19 ms. Allocated memory is still 135.8 MB. Free memory was 101.1 MB in the beginning and 91.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 135.8 MB. Free memory was 91.3 MB in the beginning and 89.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.52 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.5 MB in the beginning and 160.2 MB in the end (delta: -70.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2769.76 ms. Allocated memory was 200.3 MB in the beginning and 251.7 MB in the end (delta: 51.4 MB). Free memory was 160.2 MB in the beginning and 217.0 MB in the end (delta: -56.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 22]: Procedure Contract for mutex_unlock Derived contract for procedure mutex_unlock: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for err Derived contract for procedure err: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for mutex_lock [2020-07-10 19:00:43,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:00:43,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:00:43,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 19:00:43,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure mutex_lock: ((a == a && unknown-#memory_int-unknown[a][a] == 1) && a == a) || !(0 == \old(unknown-#memory_int-unknown)[a][a]) - ProcedureContractResult [Line: 28]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 SDtfs, 43 SDslu, 89 SDs, 0 SdLazy, 179 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 56 PreInvPairs, 69 NumberOfFragments, 281 HoareAnnotationTreeSize, 56 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 265 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...