java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:06:08,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:06:08,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:06:08,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:06:08,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:06:08,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:06:08,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:06:08,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:06:08,845 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:06:08,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:06:08,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:06:08,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:06:08,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:06:08,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:06:08,851 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:06:08,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:06:08,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:06:08,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:06:08,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:06:08,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:06:08,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:06:08,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:06:08,863 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:06:08,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:06:08,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:06:08,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:06:08,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:06:08,866 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:06:08,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:06:08,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:06:08,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:06:08,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:06:08,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:06:08,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:06:08,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:06:08,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:06:08,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:06:08,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:06:08,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:06:08,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:06:08,906 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:06:08,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:06:08,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:06:08,907 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:06:08,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:06:08,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:06:08,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:06:08,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:06:08,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:06:08,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:06:08,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:06:08,910 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:06:08,910 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:06:08,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:06:08,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:06:08,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:06:08,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:06:08,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:06:08,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:06:08,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:06:08,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:06:08,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:08,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:06:08,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:06:08,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:06:08,914 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:06:08,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:06:08,915 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:06:08,915 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:06:08,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:06:08,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:06:09,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:06:09,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:06:09,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:06:09,011 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:06:09,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 11:06:09,080 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75db3cf7/e7b852eed4484709ab41afc5cb2900cd/FLAG6b12be58f [2018-11-23 11:06:09,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:06:09,549 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 11:06:09,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75db3cf7/e7b852eed4484709ab41afc5cb2900cd/FLAG6b12be58f [2018-11-23 11:06:09,904 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75db3cf7/e7b852eed4484709ab41afc5cb2900cd [2018-11-23 11:06:09,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:06:09,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:06:09,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:09,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:06:09,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:06:09,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:09" (1/1) ... [2018-11-23 11:06:09,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7fdbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:09, skipping insertion in model container [2018-11-23 11:06:09,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:09" (1/1) ... [2018-11-23 11:06:09,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:06:09,962 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:06:10,188 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:10,204 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:06:10,225 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:10,246 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:06:10,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10 WrapperNode [2018-11-23 11:06:10,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:10,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:10,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:06:10,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:06:10,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:10,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:06:10,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:06:10,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:06:10,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (1/1) ... [2018-11-23 11:06:10,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:06:10,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:06:10,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:06:10,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:06:10,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (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 [2018-11-23 11:06:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:06:10,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:06:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:06:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure err [2018-11-23 11:06:10,475 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2018-11-23 11:06:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:06:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 11:06:10,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 11:06:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:06:10,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:06:10,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:06:10,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:06:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:06:10,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:06:11,013 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:06:11,014 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:06:11,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:11 BoogieIcfgContainer [2018-11-23 11:06:11,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:06:11,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:06:11,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:06:11,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:06:11,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:06:09" (1/3) ... [2018-11-23 11:06:11,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ada2569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:11, skipping insertion in model container [2018-11-23 11:06:11,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:10" (2/3) ... [2018-11-23 11:06:11,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ada2569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:11, skipping insertion in model container [2018-11-23 11:06:11,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:11" (3/3) ... [2018-11-23 11:06:11,023 INFO L112 eAbstractionObserver]: Analyzing ICFG mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 11:06:11,033 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:06:11,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:06:11,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:06:11,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:06:11,096 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:06:11,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:06:11,097 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:06:11,097 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:06:11,097 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:06:11,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:06:11,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:06:11,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:06:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:06:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:06:11,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:11,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:11,129 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:11,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:11,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1740940083, now seen corresponding path program 1 times [2018-11-23 11:06:11,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:11,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:11,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:11,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:11,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:06:11,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:06:11,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:06:11,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:06:11,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:06:11,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:11,950 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,950 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, mutex_lock_~a.base]. (let ((.cse0 (select (select |#memory_int| mutex_lock_~a.base) (_ bv0 32)))) (and (= (_ bv0 32) .cse0) (= |mutex_lock_#t~mem0| .cse0))) [2018-11-23 11:06:11,951 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |mutex_lock_#t~mem0|) [2018-11-23 11:06:12,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 11:06:12,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-23 11:06:12,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:06:12,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #26#return; {26#true} is VALID [2018-11-23 11:06:12,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 11:06:12,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32);call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); {46#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} is VALID [2018-11-23 11:06:12,023 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} call mutex_lock(~#m~0.base, ~#m~0.offset); {50#(and (= (_ bv0 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)) (= |mutex_lock_#in~a.offset| (_ bv0 32)))} is VALID [2018-11-23 11:06:12,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#(and (= (_ bv0 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)) (= |mutex_lock_#in~a.offset| (_ bv0 32)))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); {54#(= (_ bv0 32) |mutex_lock_#t~mem0|)} is VALID [2018-11-23 11:06:12,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#(= (_ bv0 32) |mutex_lock_#t~mem0|)} assume 1bv32 == #t~mem0;havoc #t~mem0; {27#false} is VALID [2018-11-23 11:06:12,049 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call err(); {27#false} is VALID [2018-11-23 11:06:12,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 11:06:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:12,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:12,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:12,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:06:12,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 11:06:12,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:12,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:06:12,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:12,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:06:12,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:06:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:06:12,116 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 11:06:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:12,858 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 11:06:12,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:06:12,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 11:06:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:06:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:06:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:06:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:06:12,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 11:06:13,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:13,201 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:06:13,201 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:06:13,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:06:13,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:06:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:06:13,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:13,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:06:13,325 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:06:13,325 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:06:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:13,329 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 11:06:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 11:06:13,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:13,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:13,331 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:06:13,331 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:06:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:13,335 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-23 11:06:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 11:06:13,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:13,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:13,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:13,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:06:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-23 11:06:13,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 11 [2018-11-23 11:06:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:13,341 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-23 11:06:13,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:06:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 11:06:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:06:13,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:13,343 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:13,343 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:13,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:13,344 INFO L82 PathProgramCache]: Analyzing trace with hash 68232763, now seen corresponding path program 1 times [2018-11-23 11:06:13,344 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:13,344 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:13,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:06:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:06:13,441 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv2 32), |#NULL.offset|=(_ bv3 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] RET #26#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32);call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#m~0.base|=(_ bv5 32), |main_~#m~0.offset|=(_ bv0 32)] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32), |mutex_lock_#t~mem0|=(_ bv0 32)] [?] assume !(1bv32 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] assume true; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] RET #30#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#m~0.base|=(_ bv5 32), |main_~#m~0.offset|=(_ bv0 32)] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32), |mutex_lock_#t~mem0|=(_ bv1 32)] [?] assume 1bv32 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] CALL call err(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2bv32, #NULL.offset=3bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32); [L34] call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume !(1bv32 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L22] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L19-L23] ensures true; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=1bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume 1bv32 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] CALL call err(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2bv32, #NULL.offset=3bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32); [L34] call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume !(1bv32 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L22] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L19-L23] ensures true; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=1bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume 1bv32 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] CALL call err(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={5:0}] [L36] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={5:0}, a={5:0}] [L36] RET mutex_lock(&m) VAL [m={5:0}] [L40] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 11:06:13,554 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:06:13,554 WARN L170 areAnnotationChecker]: errENTRY has no Hoare annotation [2018-11-23 11:06:13,554 WARN L170 areAnnotationChecker]: errENTRY has no Hoare annotation [2018-11-23 11:06:13,554 WARN L170 areAnnotationChecker]: mutex_lockENTRY has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: errFINAL has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:06:13,555 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:06:13,556 WARN L170 areAnnotationChecker]: errEXIT has no Hoare annotation [2018-11-23 11:06:13,557 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:06:13,557 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:06:13,557 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 11:06:13,557 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:06:13,558 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-11-23 11:06:13,558 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-11-23 11:06:13,558 WARN L170 areAnnotationChecker]: mutex_lockFINAL has no Hoare annotation [2018-11-23 11:06:13,558 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:06:13,558 WARN L170 areAnnotationChecker]: mutex_lockEXIT has no Hoare annotation [2018-11-23 11:06:13,559 WARN L170 areAnnotationChecker]: mutex_lockEXIT has no Hoare annotation [2018-11-23 11:06:13,559 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:06:13,559 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:06:13,559 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:06:13,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:06:13 BoogieIcfgContainer [2018-11-23 11:06:13,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:06:13,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:06:13,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:06:13,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:06:13,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:11" (3/4) ... [2018-11-23 11:06:13,567 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv2 32), |#NULL.offset|=(_ bv3 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv2 32), |old(#NULL.offset)|=(_ bv3 32)] [?] RET #26#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32);call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#m~0.base|=(_ bv5 32), |main_~#m~0.offset|=(_ bv0 32)] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32), |mutex_lock_#t~mem0|=(_ bv0 32)] [?] assume !(1bv32 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] assume true; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] RET #30#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#m~0.base|=(_ bv5 32), |main_~#m~0.offset|=(_ bv0 32)] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32), |mutex_lock_#t~mem0|=(_ bv1 32)] [?] assume 1bv32 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=(_ bv5 32), mutex_lock_~a.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |mutex_lock_#in~a.base|=(_ bv5 32), |mutex_lock_#in~a.offset|=(_ bv0 32)] [?] CALL call err(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] assume !false; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2bv32, #NULL.offset=3bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32); [L34] call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume !(1bv32 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L22] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L19-L23] ensures true; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=1bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume 1bv32 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] CALL call err(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2bv32, #NULL.offset=3bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=2bv32, old(#NULL.offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32); [L34] call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume !(1bv32 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L22] call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L19-L23] ensures true; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#m~0.base=5bv32, ~#m~0.offset=0bv32] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, #t~mem0=1bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] assume 1bv32 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=5bv32, #in~a.offset=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~a.base=5bv32, ~a.offset=0bv32] [L21] CALL call err(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L13] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2bv32, #NULL!offset=3bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=2bv32, old(#NULL!offset)=3bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4bv32); [L34] FCALL call write~intINTTYPE4(0bv32, { base: ~#m~0!base, offset: ~#m~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND FALSE !(1bv32 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L22] FCALL call write~intINTTYPE4(1bv32, { base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#m~0!base=5bv32, ~#m~0!offset=0bv32] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~intINTTYPE4({ base: ~a!base, offset: ~a!offset }, 4bv32); VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, #t~mem0=1bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] COND TRUE 1bv32 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=5bv32, #in~a!offset=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~a!base=5bv32, ~a!offset=0bv32] [L21] CALL call err(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L13] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={5:0}] [L36] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={5:0}, a={5:0}] [L36] RET mutex_lock(&m) VAL [m={5:0}] [L40] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 11:06:13,652 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 11:06:13,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:06:13,653 INFO L168 Benchmark]: Toolchain (without parser) took 3738.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -640.2 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:13,656 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:13,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:13,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:13,658 INFO L168 Benchmark]: Boogie Preprocessor took 40.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:13,658 INFO L168 Benchmark]: RCFGBuilder took 695.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:13,659 INFO L168 Benchmark]: TraceAbstraction took 2547.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:13,660 INFO L168 Benchmark]: Witness Printer took 89.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:13,665 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 695.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2547.02 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. * Witness Printer took 89.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={5:0}] [L36] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={5:0}, a={5:0}] [L36] RET mutex_lock(&m) VAL [m={5:0}] [L40] CALL mutex_lock(&m) VAL [a={5:0}] [L21] EXPR a->is_locked VAL [a={5:0}, a={5:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 1 SDslu, 47 SDs, 0 SdLazy, 17 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 6 NumberOfNonLiveVariables, 39 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...