./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fcaf98e9698415fefa37f25d310a7a516d84123 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:23:01,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:23:01,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:23:01,978 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:23:01,978 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:23:01,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:23:01,979 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:23:01,980 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:23:01,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:23:01,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:23:01,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:23:01,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:23:01,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:23:01,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:23:01,984 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:23:01,985 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:23:01,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:23:01,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:23:01,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:23:01,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:23:01,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:23:01,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:23:01,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:23:01,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:23:01,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:23:01,993 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:23:01,994 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:23:01,994 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:23:01,995 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:23:01,995 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:23:01,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:23:01,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:23:01,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:23:01,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:23:01,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:23:01,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:23:01,998 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 04:23:02,007 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:23:02,007 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:23:02,008 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:23:02,008 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:23:02,009 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:23:02,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:23:02,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:23:02,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:23:02,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:23:02,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:23:02,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:23:02,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:23:02,012 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fcaf98e9698415fefa37f25d310a7a516d84123 [2018-11-23 04:23:02,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:23:02,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:23:02,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:23:02,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:23:02,045 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:23:02,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 04:23:02,080 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/data/ab0b752e7/6b243191962345b38382854b8f076532/FLAG6be5e553a [2018-11-23 04:23:02,478 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:23:02,478 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/sv-benchmarks/c/ldv-regression/mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 04:23:02,482 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/data/ab0b752e7/6b243191962345b38382854b8f076532/FLAG6be5e553a [2018-11-23 04:23:02,493 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/data/ab0b752e7/6b243191962345b38382854b8f076532 [2018-11-23 04:23:02,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:23:02,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:23:02,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:23:02,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:23:02,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:23:02,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc0002c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02, skipping insertion in model container [2018-11-23 04:23:02,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:23:02,528 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:23:02,638 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:23:02,644 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:23:02,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:23:02,662 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:23:02,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02 WrapperNode [2018-11-23 04:23:02,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:23:02,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:23:02,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:23:02,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:23:02,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:23:02,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:23:02,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:23:02,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:23:02,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... [2018-11-23 04:23:02,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:23:02,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:23:02,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:23:02,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:23:02,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/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 04:23:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:23:02,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:23:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure err [2018-11-23 04:23:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-23 04:23:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:23:02,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:23:02,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:23:02,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:23:02,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:23:02,840 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:23:02,840 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 04:23:02,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:23:02 BoogieIcfgContainer [2018-11-23 04:23:02,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:23:02,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:23:02,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:23:02,844 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:23:02,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:23:02" (1/3) ... [2018-11-23 04:23:02,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bee42fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:23:02, skipping insertion in model container [2018-11-23 04:23:02,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:23:02" (2/3) ... [2018-11-23 04:23:02,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bee42fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:23:02, skipping insertion in model container [2018-11-23 04:23:02,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:23:02" (3/3) ... [2018-11-23 04:23:02,846 INFO L112 eAbstractionObserver]: Analyzing ICFG mutex_lock_struct_true-termination.c_false-unreach-call.i [2018-11-23 04:23:02,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:23:02,856 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:23:02,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:23:02,891 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:23:02,891 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:23:02,891 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:23:02,891 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:23:02,891 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:23:02,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:23:02,892 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:23:02,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:23:02,892 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:23:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 04:23:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 04:23:02,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:23:02,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:23:02,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:23:02,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:23:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1740940083, now seen corresponding path program 1 times [2018-11-23 04:23:02,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:23:02,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:23:02,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:23:02,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:23:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:23:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:23:03,048 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 04:23:03,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:23:03,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:23:03,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:23:03,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:23:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:23:03,063 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-23 04:23:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:23:03,161 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 04:23:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:23:03,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 04:23:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:23:03,169 INFO L225 Difference]: With dead ends: 40 [2018-11-23 04:23:03,170 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 04:23:03,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:23:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 04:23:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 04:23:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 04:23:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-23 04:23:03,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 11 [2018-11-23 04:23:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:23:03,200 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-23 04:23:03,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:23:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-23 04:23:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 04:23:03,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:23:03,201 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:23:03,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:23:03,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:23:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash 68232763, now seen corresponding path program 1 times [2018-11-23 04:23:03,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:23:03,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:23:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:23:03,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:23:03,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:23:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:23:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:23:03,242 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4);call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=0] [?] assume !(1 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] call write~int(1, ~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] assume true; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=1] [?] assume 1 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] CALL call err(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 04:23:03,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:23:03 BoogieIcfgContainer [2018-11-23 04:23:03,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:23:03,278 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:23:03,278 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:23:03,278 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:23:03,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:23:02" (3/4) ... [2018-11-23 04:23:03,280 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|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #26#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret2 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4);call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=0] [?] assume !(1 == #t~mem0);havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] call write~int(1, ~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] assume true; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] RET #30#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#m~0.base|=6, |main_~#m~0.offset|=0] [?] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0, |mutex_lock_#t~mem0|=1] [?] assume 1 == #t~mem0;havoc #t~mem0; VAL [mutex_lock_~a.base=6, mutex_lock_~a.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |mutex_lock_#in~a.base|=6, |mutex_lock_#in~a.offset|=0] [?] CALL call err(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L33] call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4); [L34] call write~int(0, ~#m~0.base, ~#m~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L36] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=0, ~a.base=6, ~a.offset=0] [L21] assume !(1 == #t~mem0); [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L22] call write~int(1, ~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L19-L23] ensures true; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L36] RET call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~#m~0.base=6, ~#m~0.offset=0] [L40] CALL call mutex_lock(~#m~0.base, ~#m~0.offset); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0] [L19-L23] ~a.base, ~a.offset := #in~a.base, #in~a.offset; [L21] call #t~mem0 := read~int(~a.base, ~a.offset, 4); VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem0=1, ~a.base=6, ~a.offset=0] [L21] assume 1 == #t~mem0; [L21] havoc #t~mem0; VAL [#in~a.base=6, #in~a.offset=0, #NULL.base=0, #NULL.offset=0, ~a.base=6, ~a.offset=0] [L21] CALL call err(); VAL [#NULL.base=0, #NULL.offset=0] [L13] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret2 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#m~0 := #Ultimate.alloc(4); [L34] FCALL call write~int(0, { base: ~#m~0!base, offset: ~#m~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L36] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=0, ~a!base=6, ~a!offset=0] [L21] COND FALSE !(1 == #t~mem0) [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L22] FCALL call write~int(1, { base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L36] RET call mutex_lock(~#m~0); VAL [#NULL!base=0, #NULL!offset=0, ~#m~0!base=6, ~#m~0!offset=0] [L40] CALL call mutex_lock(~#m~0); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0] [L19-L23] ~a := #in~a; [L21] FCALL call #t~mem0 := read~int({ base: ~a!base, offset: ~a!offset }, 4); VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem0=1, ~a!base=6, ~a!offset=0] [L21] COND TRUE 1 == #t~mem0 [L21] havoc #t~mem0; VAL [#in~a!base=6, #in~a!offset=0, #NULL!base=0, #NULL!offset=0, ~a!base=6, ~a!offset=0] [L21] CALL call err(); VAL [#NULL!base=0, #NULL!offset=0] [L13] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L33] struct mutex m; [L34] m.is_locked = 0 VAL [m={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=1] [L21] COND TRUE a->is_locked == 1 [L21] CALL err() [L13] __VERIFIER_error() ----- [2018-11-23 04:23:03,312 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ff6e8420-fdfd-4078-bc44-60d8629be3f7/bin-2019/uautomizer/witness.graphml [2018-11-23 04:23:03,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:23:03,312 INFO L168 Benchmark]: Toolchain (without parser) took 816.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,313 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:23:03,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.40 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,314 INFO L168 Benchmark]: Boogie Preprocessor took 11.37 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:23:03,315 INFO L168 Benchmark]: RCFGBuilder took 151.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 946.8 MB in the beginning and 1.2 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,315 INFO L168 Benchmark]: TraceAbstraction took 436.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,316 INFO L168 Benchmark]: Witness Printer took 33.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:23:03,319 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.40 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.37 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 151.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 946.8 MB in the beginning and 1.2 GB in the end (delta: -207.0 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 436.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 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={6:0}] [L36] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6:0}, a->is_locked=0] [L21] COND FALSE !(a->is_locked == 1) [L22] a->is_locked = 1 VAL [a={6:0}, a={6:0}] [L36] RET mutex_lock(&m) VAL [m={6:0}] [L40] CALL mutex_lock(&m) VAL [a={6:0}] [L21] EXPR a->is_locked VAL [a={6:0}, a={6: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, 0.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 0.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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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...