./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 56b20b6796faad8ab2b7905f19aea09fce4f4ac8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 17:57:02,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:57:02,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:57:02,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:57:02,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:57:02,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:57:02,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:57:02,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:57:02,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:57:02,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:57:02,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:57:02,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:57:02,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:57:02,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:57:02,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:57:02,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:57:02,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:57:02,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:57:02,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:57:02,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:57:02,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:57:02,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:57:02,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:57:02,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:57:02,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:57:02,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:57:02,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:57:02,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:57:02,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:57:02,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:57:02,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:57:02,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:57:02,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:57:02,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:57:02,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:57:02,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:57:02,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:57:02,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:57:02,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:57:02,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:57:02,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:57:02,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:57:02,163 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:57:02,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:57:02,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:57:02,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:57:02,166 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:57:02,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:57:02,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:57:02,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:57:02,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:57:02,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:57:02,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:57:02,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:57:02,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:57:02,168 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:57:02,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:57:02,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:57:02,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:57:02,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:57:02,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:57:02,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:57:02,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:57:02,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:02,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:57:02,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:57:02,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:57:02,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:57:02,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:57:02,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:57:02,173 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:57:02,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 56b20b6796faad8ab2b7905f19aea09fce4f4ac8 [2019-11-28 17:57:02,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:57:02,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:57:02,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:57:02,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:57:02,528 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:57:02,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2019-11-28 17:57:02,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d29f0bb1/80f24e2f3d9049da9c65351fe30529d6/FLAG1da9c95f1 [2019-11-28 17:57:03,200 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:57:03,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2019-11-28 17:57:03,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d29f0bb1/80f24e2f3d9049da9c65351fe30529d6/FLAG1da9c95f1 [2019-11-28 17:57:03,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d29f0bb1/80f24e2f3d9049da9c65351fe30529d6 [2019-11-28 17:57:03,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:57:03,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:57:03,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:03,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:57:03,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:57:03,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:03" (1/1) ... [2019-11-28 17:57:03,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0c7b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:03, skipping insertion in model container [2019-11-28 17:57:03,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:03" (1/1) ... [2019-11-28 17:57:03,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:57:03,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:57:04,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:04,093 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:57:04,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:04,348 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:57:04,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04 WrapperNode [2019-11-28 17:57:04,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:04,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:04,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:57:04,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:57:04,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:04,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:57:04,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:57:04,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:57:04,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (1/1) ... [2019-11-28 17:57:04,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:57:04,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:57:04,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:57:04,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:57:04,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (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 [2019-11-28 17:57:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-28 17:57:04,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-28 17:57:04,674 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-28 17:57:04,676 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-28 17:57:04,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:57:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:57:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:57:04,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:57:04,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-28 17:57:04,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:57:04,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:57:04,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:57:04,683 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 17:57:05,410 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:57:05,411 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-28 17:57:05,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:05 BoogieIcfgContainer [2019-11-28 17:57:05,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:57:05,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:57:05,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:57:05,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:57:05,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:57:03" (1/3) ... [2019-11-28 17:57:05,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b8306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:05, skipping insertion in model container [2019-11-28 17:57:05,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:04" (2/3) ... [2019-11-28 17:57:05,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2b8306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:05, skipping insertion in model container [2019-11-28 17:57:05,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:05" (3/3) ... [2019-11-28 17:57:05,422 INFO L109 eAbstractionObserver]: Analyzing ICFG stack-2.i [2019-11-28 17:57:05,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:57:05,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:57:05,441 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:57:05,442 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:57:05,481 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,481 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,481 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,481 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,482 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,482 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,482 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,482 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,483 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,483 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,483 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,483 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,484 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,484 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,484 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,484 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,485 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,485 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,485 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,485 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,485 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,486 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,486 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,486 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,486 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,487 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,487 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,487 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,487 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,487 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,488 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,488 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,488 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,488 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,489 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,489 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,489 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,489 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,490 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,490 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,490 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,490 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,491 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,491 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,491 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,491 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,492 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,492 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,492 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,492 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,492 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,493 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,493 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,493 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,494 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,494 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,494 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,494 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,494 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,495 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,495 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,495 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,496 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,497 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,497 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,497 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,497 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,498 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,498 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,498 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,498 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,500 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,501 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,501 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,502 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,502 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,502 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,503 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,503 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,507 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,507 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,507 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,507 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,507 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,508 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,508 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,508 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,508 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,510 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,510 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,510 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,510 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,510 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,511 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,511 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,511 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,511 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,511 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,512 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,547 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 17:57:05,565 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:57:05,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:57:05,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:57:05,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:57:05,566 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:57:05,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:57:05,566 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:57:05,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:57:05,585 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 144 transitions [2019-11-28 17:57:05,587 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions [2019-11-28 17:57:05,705 INFO L134 PetriNetUnfolder]: 10/144 cut-off events. [2019-11-28 17:57:05,706 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:05,723 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 144 events. 10/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 417 event pairs. 19/152 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-11-28 17:57:05,736 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions [2019-11-28 17:57:05,820 INFO L134 PetriNetUnfolder]: 10/144 cut-off events. [2019-11-28 17:57:05,821 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:05,825 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 144 events. 10/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 417 event pairs. 19/152 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-11-28 17:57:05,835 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5952 [2019-11-28 17:57:05,837 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:57:08,007 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-28 17:57:09,276 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-11-28 17:57:09,386 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 17:57:09,619 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 17:57:09,762 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-28 17:57:10,325 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 121 [2019-11-28 17:57:10,612 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-28 17:57:10,628 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8014 [2019-11-28 17:57:10,628 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-11-28 17:57:10,632 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 41 transitions [2019-11-28 17:57:10,696 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 362 states. [2019-11-28 17:57:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states. [2019-11-28 17:57:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 17:57:10,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:10,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 17:57:10,715 INFO L410 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 150516578, now seen corresponding path program 1 times [2019-11-28 17:57:10,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:10,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145092569] [2019-11-28 17:57:10,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145092569] [2019-11-28 17:57:11,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:11,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:11,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230939944] [2019-11-28 17:57:11,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:11,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,194 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 3 states. [2019-11-28 17:57:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:11,331 INFO L93 Difference]: Finished difference Result 575 states and 1450 transitions. [2019-11-28 17:57:11,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:11,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 17:57:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:11,375 INFO L225 Difference]: With dead ends: 575 [2019-11-28 17:57:11,376 INFO L226 Difference]: Without dead ends: 548 [2019-11-28 17:57:11,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-28 17:57:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 501. [2019-11-28 17:57:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-28 17:57:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1328 transitions. [2019-11-28 17:57:11,515 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1328 transitions. Word has length 6 [2019-11-28 17:57:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:11,516 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1328 transitions. [2019-11-28 17:57:11,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1328 transitions. [2019-11-28 17:57:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:57:11,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:11,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:11,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1112244910, now seen corresponding path program 1 times [2019-11-28 17:57:11,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:11,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788553829] [2019-11-28 17:57:11,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:11,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788553829] [2019-11-28 17:57:11,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:11,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:11,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32404141] [2019-11-28 17:57:11,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:11,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:11,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,628 INFO L87 Difference]: Start difference. First operand 501 states and 1328 transitions. Second operand 3 states. [2019-11-28 17:57:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:11,651 INFO L93 Difference]: Finished difference Result 614 states and 1590 transitions. [2019-11-28 17:57:11,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:11,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 17:57:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:11,657 INFO L225 Difference]: With dead ends: 614 [2019-11-28 17:57:11,657 INFO L226 Difference]: Without dead ends: 582 [2019-11-28 17:57:11,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-28 17:57:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 542. [2019-11-28 17:57:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-28 17:57:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1446 transitions. [2019-11-28 17:57:11,697 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1446 transitions. Word has length 8 [2019-11-28 17:57:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:11,698 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1446 transitions. [2019-11-28 17:57:11,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1446 transitions. [2019-11-28 17:57:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:57:11,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:11,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:11,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -726344194, now seen corresponding path program 1 times [2019-11-28 17:57:11,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:11,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815501729] [2019-11-28 17:57:11,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:11,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815501729] [2019-11-28 17:57:11,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:11,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:11,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983839910] [2019-11-28 17:57:11,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:11,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:11,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,792 INFO L87 Difference]: Start difference. First operand 542 states and 1446 transitions. Second operand 3 states. [2019-11-28 17:57:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:11,809 INFO L93 Difference]: Finished difference Result 574 states and 1527 transitions. [2019-11-28 17:57:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:11,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 17:57:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:11,817 INFO L225 Difference]: With dead ends: 574 [2019-11-28 17:57:11,818 INFO L226 Difference]: Without dead ends: 574 [2019-11-28 17:57:11,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-28 17:57:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-28 17:57:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-28 17:57:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1527 transitions. [2019-11-28 17:57:11,842 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1527 transitions. Word has length 10 [2019-11-28 17:57:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:11,842 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1527 transitions. [2019-11-28 17:57:11,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1527 transitions. [2019-11-28 17:57:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:57:11,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:11,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:11,852 INFO L410 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1779312196, now seen corresponding path program 1 times [2019-11-28 17:57:11,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:11,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000573338] [2019-11-28 17:57:11,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:11,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000573338] [2019-11-28 17:57:11,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805924080] [2019-11-28 17:57:11,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:12,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:57:12,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:12,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:12,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 17:57:12,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883826897] [2019-11-28 17:57:12,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:57:12,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:57:12,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:57:12,148 INFO L87 Difference]: Start difference. First operand 574 states and 1527 transitions. Second operand 7 states. [2019-11-28 17:57:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:12,262 INFO L93 Difference]: Finished difference Result 881 states and 2258 transitions. [2019-11-28 17:57:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:57:12,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 17:57:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:12,268 INFO L225 Difference]: With dead ends: 881 [2019-11-28 17:57:12,269 INFO L226 Difference]: Without dead ends: 876 [2019-11-28 17:57:12,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:57:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2019-11-28 17:57:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 698. [2019-11-28 17:57:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2019-11-28 17:57:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1846 transitions. [2019-11-28 17:57:12,291 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1846 transitions. Word has length 14 [2019-11-28 17:57:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:12,292 INFO L462 AbstractCegarLoop]: Abstraction has 698 states and 1846 transitions. [2019-11-28 17:57:12,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:57:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1846 transitions. [2019-11-28 17:57:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:57:12,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:12,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:12,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:12,497 INFO L410 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash 624439316, now seen corresponding path program 1 times [2019-11-28 17:57:12,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:12,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499432775] [2019-11-28 17:57:12,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:12,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499432775] [2019-11-28 17:57:12,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:12,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:12,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659020980] [2019-11-28 17:57:12,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:12,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:12,567 INFO L87 Difference]: Start difference. First operand 698 states and 1846 transitions. Second operand 3 states. [2019-11-28 17:57:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:12,600 INFO L93 Difference]: Finished difference Result 367 states and 824 transitions. [2019-11-28 17:57:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:12,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 17:57:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:12,604 INFO L225 Difference]: With dead ends: 367 [2019-11-28 17:57:12,604 INFO L226 Difference]: Without dead ends: 355 [2019-11-28 17:57:12,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-28 17:57:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2019-11-28 17:57:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-28 17:57:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 751 transitions. [2019-11-28 17:57:12,613 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 751 transitions. Word has length 16 [2019-11-28 17:57:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:12,614 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 751 transitions. [2019-11-28 17:57:12,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 751 transitions. [2019-11-28 17:57:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:12,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:12,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:12,616 INFO L410 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash -374234950, now seen corresponding path program 1 times [2019-11-28 17:57:12,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:12,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038253730] [2019-11-28 17:57:12,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:12,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038253730] [2019-11-28 17:57:12,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:12,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:57:12,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903254131] [2019-11-28 17:57:12,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:57:12,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:57:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:57:12,678 INFO L87 Difference]: Start difference. First operand 335 states and 751 transitions. Second operand 5 states. [2019-11-28 17:57:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:12,745 INFO L93 Difference]: Finished difference Result 456 states and 1016 transitions. [2019-11-28 17:57:12,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:57:12,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 17:57:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:12,749 INFO L225 Difference]: With dead ends: 456 [2019-11-28 17:57:12,749 INFO L226 Difference]: Without dead ends: 456 [2019-11-28 17:57:12,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:57:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-28 17:57:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 373. [2019-11-28 17:57:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 17:57:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 848 transitions. [2019-11-28 17:57:12,760 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 848 transitions. Word has length 17 [2019-11-28 17:57:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:12,760 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 848 transitions. [2019-11-28 17:57:12,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:57:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 848 transitions. [2019-11-28 17:57:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:57:12,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:12,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:12,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2006895005, now seen corresponding path program 1 times [2019-11-28 17:57:12,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:12,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324026276] [2019-11-28 17:57:12,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:13,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324026276] [2019-11-28 17:57:13,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:13,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 17:57:13,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481424376] [2019-11-28 17:57:13,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:57:13,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:57:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:57:13,238 INFO L87 Difference]: Start difference. First operand 373 states and 848 transitions. Second operand 14 states. [2019-11-28 17:57:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:14,515 INFO L93 Difference]: Finished difference Result 779 states and 1709 transitions. [2019-11-28 17:57:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:57:14,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-28 17:57:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:14,522 INFO L225 Difference]: With dead ends: 779 [2019-11-28 17:57:14,522 INFO L226 Difference]: Without dead ends: 765 [2019-11-28 17:57:14,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:57:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-28 17:57:14,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 458. [2019-11-28 17:57:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-28 17:57:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1045 transitions. [2019-11-28 17:57:14,541 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1045 transitions. Word has length 21 [2019-11-28 17:57:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:14,541 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 1045 transitions. [2019-11-28 17:57:14,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:57:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1045 transitions. [2019-11-28 17:57:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:57:14,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:14,544 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:14,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1651770902, now seen corresponding path program 2 times [2019-11-28 17:57:14,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:14,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833415900] [2019-11-28 17:57:14,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:14,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833415900] [2019-11-28 17:57:14,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470344291] [2019-11-28 17:57:14,618 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:14,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:57:14,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:57:14,710 INFO L264 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:57:14,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:14,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:14,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:57:14,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533240377] [2019-11-28 17:57:14,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 17:57:14,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 17:57:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:57:14,737 INFO L87 Difference]: Start difference. First operand 458 states and 1045 transitions. Second operand 9 states. [2019-11-28 17:57:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:14,825 INFO L93 Difference]: Finished difference Result 805 states and 1787 transitions. [2019-11-28 17:57:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:57:14,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 17:57:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:14,836 INFO L225 Difference]: With dead ends: 805 [2019-11-28 17:57:14,836 INFO L226 Difference]: Without dead ends: 794 [2019-11-28 17:57:14,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:57:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-11-28 17:57:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 570. [2019-11-28 17:57:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-28 17:57:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1311 transitions. [2019-11-28 17:57:14,873 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1311 transitions. Word has length 22 [2019-11-28 17:57:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:14,874 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1311 transitions. [2019-11-28 17:57:14,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 17:57:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1311 transitions. [2019-11-28 17:57:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:57:14,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:14,876 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:15,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:15,081 INFO L410 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:57:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:15,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1466304191, now seen corresponding path program 1 times [2019-11-28 17:57:15,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:15,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518502769] [2019-11-28 17:57:15,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:15,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:57:15,220 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:57:15,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [560] [560] ULTIMATE.startENTRY-->L1001-1: Formula: (let ((.cse7 (store |v_#valid_63| 0 0))) (let ((.cse3 (store .cse7 |v_#t~string35.base_8| 1))) (let ((.cse4 (store .cse3 |v_#t~string39.base_8| 1))) (let ((.cse5 (store .cse4 |v_~#arr~0.base_45| 1))) (let ((.cse6 (store .cse5 |v_~#m~0.base_95| 1))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22| 1)) (.cse0 (select |v_#memory_int_72| |v_~#arr~0.base_45|)) (.cse1 (select |v_#memory_int_72| |v_~#m~0.base_95|))) (and (= |v_~#m~0.offset_95| 0) (< |v_#StackHeapBarrier_21| |v_~#m~0.base_95|) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_25|) (= |v_#NULL.offset_3| 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 (select .cse0 (+ |v_~#arr~0.offset_45| 4))) (= 0 (select .cse1 (+ |v_~#m~0.offset_95| 12))) (= (select .cse1 (+ |v_~#m~0.offset_95| 4)) 0) (< |v_#StackHeapBarrier_21| |v_#t~string35.base_8|) (< |v_#StackHeapBarrier_21| |v_#t~string39.base_8|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_19|) (= |v_#t~string35.offset_8| 0) (= (select .cse0 (+ |v_~#arr~0.offset_45| 16)) 0) (= (store |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22| (store (select |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22|) |v_ULTIMATE.start_main_~#id1~0.offset_19| 0)) |v_#memory_int_71|) (= (select .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28|) 0) (= 0 |v_#t~string39.offset_8|) (= 0 |v_~#arr~0.offset_45|) (= (select .cse1 (+ |v_~#m~0.offset_95| 8)) 0) (= (select .cse0 (+ |v_~#arr~0.offset_45| 12)) 0) (= |v_#valid_61| (store .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28| 1)) (= 0 (select .cse3 |v_#t~string39.base_8|)) (= 0 (select .cse1 |v_~#m~0.offset_95|)) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id1~0.base_22|) (= |v_#pthreadsMutex_212| (store |v_#pthreadsMutex_213| |v_~#m~0.base_95| (store (select |v_#pthreadsMutex_213| |v_~#m~0.base_95|) |v_~#m~0.offset_95| 0))) (= 0 (select .cse4 |v_~#arr~0.base_45|)) (= (select .cse0 (+ |v_~#arr~0.offset_45| 8)) 0) (= (select .cse0 |v_~#arr~0.offset_45|) 0) (= 0 |v_#NULL.base_3|) (= (select .cse5 |v_~#m~0.base_95|) 0) (= 0 v_~top~0_145) (= (select .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22|) 0) (= (select .cse1 (+ |v_~#m~0.offset_95| 16)) 0) (= v_~flag~0_63 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id2~0.base_28|) (< |v_#StackHeapBarrier_21| |v_~#arr~0.base_45|) (= (select .cse7 |v_#t~string35.base_8|) 0) (= |v_#length_41| (store (store (store (store (store (store |v_#length_43| |v_#t~string35.base_8| 16) |v_#t~string39.base_8| 17) |v_~#arr~0.base_45| 20) |v_~#m~0.base_95| 24) |v_ULTIMATE.start_main_~#id1~0.base_22| 4) |v_ULTIMATE.start_main_~#id2~0.base_28| 4))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_213|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_72|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_22|, #t~string35.offset=|v_#t~string35.offset_8|, ~flag~0=v_~flag~0_63, #t~string39.base=|v_#t~string39.base_8|, #NULL.offset=|v_#NULL.offset_3|, ~top~0=v_~top~0_145, ULTIMATE.start_main_#t~nondet50=|v_ULTIMATE.start_main_#t~nondet50_10|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_28|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_25|, #t~string39.offset=|v_#t~string39.offset_8|, #length=|v_#length_41|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_10|, ~#arr~0.base=|v_~#arr~0.base_45|, #pthreadsMutex=|v_#pthreadsMutex_212|, ~#arr~0.offset=|v_~#arr~0.offset_45|, ULTIMATE.start_main_#t~mem52=|v_ULTIMATE.start_main_#t~mem52_20|, ULTIMATE.start_main_#t~mem51=|v_ULTIMATE.start_main_#t~mem51_15|, #t~string35.base=|v_#t~string35.base_8|, #NULL.base=|v_#NULL.base_3|, ~#m~0.base=|v_~#m~0.base_95|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ~#m~0.offset=|v_~#m~0.offset_95|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id1~0.base, #t~string35.offset, ~flag~0, #t~string39.base, #NULL.offset, ~top~0, ULTIMATE.start_main_#t~nondet50, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, #t~string39.offset, #length, ULTIMATE.start_main_#t~nondet49, ~#arr~0.base, #pthreadsMutex, ~#arr~0.offset, ULTIMATE.start_main_#t~mem52, ULTIMATE.start_main_#t~mem51, #t~string35.base, #NULL.base, ~#m~0.base, ~#m~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-11-28 17:57:15,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] L1001-2-->L1002-1: Formula: (= (store |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10| (store (select |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10|) |v_ULTIMATE.start_main_~#id2~0.offset_9| 1)) |v_#memory_int_26|) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_27|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_3|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet49] because there is no mapped edge [2019-11-28 17:57:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [502] [502] t2ENTRY-->L985-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_5| v_t2Thread1of1ForFork1_~arg.base_3) (= v_t2Thread1of1ForFork1_~i~1_16 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_5| v_t2Thread1of1ForFork1_~arg.offset_3)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_3, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_3, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_16} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [526] [526] t1ENTRY-->L970-6: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_5| v_t1Thread1of1ForFork0_~arg.offset_3) (= |v_t1Thread1of1ForFork0_#in~arg.base_5| v_t1Thread1of1ForFork0_~arg.base_3) (= v_t1Thread1of1ForFork0_~i~0_16 0)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_16, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_10, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_3, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_3, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~i~0, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 17:57:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [539] [539] L970-6-->L975: Formula: (let ((.cse0 (select |v_#pthreadsMutex_122| |v_~#m~0.base_58|))) (and (= 0 (select .cse0 |v_~#m~0.offset_58|)) (= |v_t1Thread1of1ForFork0_#t~nondet44_8| v_t1Thread1of1ForFork0_~tmp~0_11) (< v_t1Thread1of1ForFork0_~i~0_28 5) (not (= (ite (< (mod v_t1Thread1of1ForFork0_~tmp~0_11 4294967296) 5) 1 0) 0)) (= (store |v_#pthreadsMutex_122| |v_~#m~0.base_58| (store .cse0 |v_~#m~0.offset_58| 1)) |v_#pthreadsMutex_121|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_28, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_28, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_11, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet43=|v_t1Thread1of1ForFork0_#t~nondet43_22|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_7|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_#t~nondet43, t1Thread1of1ForFork0_#t~nondet44] because there is no mapped edge [2019-11-28 17:57:15,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [546] [546] L975-->L932: Formula: (and (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_6| |v_~#arr~0.offset_20|) (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_6| v_t1Thread1of1ForFork0_push_~stack.offset_17) (= |v_t1Thread1of1ForFork0_push_#in~x_20| (let ((.cse0 (mod v_t1Thread1of1ForFork0_~tmp~0_12 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (not (= 5 v_~top~0_94)) (= |v_t1Thread1of1ForFork0_push_#in~x_20| v_t1Thread1of1ForFork0_push_~x_31) (= |v_~#arr~0.base_20| |v_t1Thread1of1ForFork0_push_#in~stack.base_6|) (= |v_t1Thread1of1ForFork0_push_#in~stack.base_6| v_t1Thread1of1ForFork0_push_~stack.base_17)) InVars {~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, ~top~0=v_~top~0_94, ~#arr~0.base=|v_~#arr~0.base_20|} OutVars{t1Thread1of1ForFork0_push_#in~x=|v_t1Thread1of1ForFork0_push_#in~x_20|, ~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_17, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_20|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_30|, ~top~0=v_~top~0_94, t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_17, t1Thread1of1ForFork0_push_#in~stack.base=|v_t1Thread1of1ForFork0_push_#in~stack.base_6|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_31, t1Thread1of1ForFork0_push_#t~nondet34=|v_t1Thread1of1ForFork0_push_#t~nondet34_9|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_16|, t1Thread1of1ForFork0_push_#in~stack.offset=|v_t1Thread1of1ForFork0_push_#in~stack.offset_6|, ~#arr~0.base=|v_~#arr~0.base_20|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#in~x, t1Thread1of1ForFork0_push_~stack.base, t1Thread1of1ForFork0_push_#in~stack.base, t1Thread1of1ForFork0_push_~x, t1Thread1of1ForFork0_push_#t~nondet34, t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_~stack.offset, t1Thread1of1ForFork0_push_#res, t1Thread1of1ForFork0_push_#t~ret36, t1Thread1of1ForFork0_push_#in~stack.offset] because there is no mapped edge [2019-11-28 17:57:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [490] [490] L932-->L947-1: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res_6| |v_t1Thread1of1ForFork0_push_#t~ret36_8|) (= |v_t1Thread1of1ForFork0_get_top_#res_6| v_~top~0_33)) InVars {~top~0=v_~top~0_33} OutVars{t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_8|, ~top~0=v_~top~0_33} AuxVars[] AssignedVars[t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [503] [503] L947-1-->L948: Formula: (and (<= |v_t1Thread1of1ForFork0_push_#t~ret36_12| 2147483647) (= (store |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_9 (store (select |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_9) (+ v_t1Thread1of1ForFork0_push_~stack.offset_9 (* |v_t1Thread1of1ForFork0_push_#t~ret36_12| 4)) v_t1Thread1of1ForFork0_push_~x_10)) |v_#memory_int_38|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret36_12| 2147483648))) InVars {t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_9, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_10, #memory_int=|v_#memory_int_39|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_9, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_12|} OutVars{t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_9, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_10, #memory_int=|v_#memory_int_38|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_9, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_11|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:15,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L948-->L924-1: Formula: (= |v_t1Thread1of1ForFork0_inc_top_#t~post31_5| v_~top~0_11) InVars {~top~0=v_~top~0_11} OutVars{t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_5|, ~top~0=v_~top~0_11} AuxVars[] AssignedVars[t1Thread1of1ForFork0_inc_top_#t~post31] because there is no mapped edge [2019-11-28 17:57:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [533] [533] L924-1-->L975-4: Formula: (and (= |v_t1Thread1of1ForFork0_#t~ret45_24| |v_t1Thread1of1ForFork0_push_#res_14|) (= (+ |v_t1Thread1of1ForFork0_inc_top_#t~post31_31| 1) v_~top~0_68) (= 0 |v_t1Thread1of1ForFork0_push_#res_14|)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_31|} OutVars{t1Thread1of1ForFork0_#t~ret45=|v_t1Thread1of1ForFork0_#t~ret45_24|, t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_30|, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_14|, ~top~0=v_~top~0_68} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, t1Thread1of1ForFork0_inc_top_#t~post31, t1Thread1of1ForFork0_push_#res, ~top~0] because there is no mapped edge [2019-11-28 17:57:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] L975-4-->L978: Formula: (and (not (= (- 1) |t1Thread1of1ForFork0_#t~ret45_In-2138404180|)) (= 1 ~flag~0_Out-2138404180)) InVars {t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_In-2138404180|} OutVars{t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_Out-2138404180|, ~flag~0=~flag~0_Out-2138404180} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, ~flag~0] because there is no mapped edge [2019-11-28 17:57:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [538] [538] L978-->L970-6: Formula: (and (= (+ v_t1Thread1of1ForFork0_~i~0_25 1) v_t1Thread1of1ForFork0_~i~0_24) (= (store |v_#pthreadsMutex_114| |v_~#m~0.base_55| (store (select |v_#pthreadsMutex_114| |v_~#m~0.base_55|) |v_~#m~0.offset_55| 0)) |v_#pthreadsMutex_113|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_114|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_25, ~#m~0.offset=|v_~#m~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_113|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_#t~post42=|v_t1Thread1of1ForFork0_#t~post42_7|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_24, ~#m~0.offset=|v_~#m~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~post42, t1Thread1of1ForFork0_~i~0] because there is no mapped edge [2019-11-28 17:57:15,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_5|) (< v_t2Thread1of1ForFork1_~i~1_10 5) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [551] [551] L987-1-->L954-4: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| |v_t2Thread1of1ForFork1_get_top_#res_36|) (not (= (mod v_~flag~0_47 256) 0)) (= |v_t2Thread1of1ForFork1_get_top_#res_36| v_~top~0_126) (= v_t2Thread1of1ForFork1_pop_~stack.offset_19 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|) (= |v_~#arr~0.offset_29| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|) (= v_t2Thread1of1ForFork1_pop_~stack.base_19 |v_t2Thread1of1ForFork1_pop_#in~stack.base_17|) (= |v_~#arr~0.base_29| |v_t2Thread1of1ForFork1_pop_#in~stack.base_17|) (not (= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 0)) (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 2147483648)) (<= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 2147483647)) InVars {~#arr~0.offset=|v_~#arr~0.offset_29|, ~flag~0=v_~flag~0_47, ~top~0=v_~top~0_126, ~#arr~0.base=|v_~#arr~0.base_29|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_41|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_19, ~#arr~0.offset=|v_~#arr~0.offset_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_21|, ~flag~0=v_~flag~0_47, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|, ~top~0=v_~top~0_126, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_42|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_36|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_23|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_27|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_15|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_17|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_19, ~#arr~0.base=|v_~#arr~0.base_29|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [516] [516] L954-4-->L928-1: Formula: (= |v_t2Thread1of1ForFork1_dec_top_#t~post32_32| v_~top~0_55) InVars {~top~0=v_~top~0_55} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_32|, ~top~0=v_~top~0_55, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_16|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [487] [487] L928-1-->L926: Formula: (= v_~top~0_29 (+ |v_t2Thread1of1ForFork1_dec_top_#t~post32_13| (- 1))) InVars {t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_13|} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_12|, ~top~0=v_~top~0_29} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, ~top~0] because there is no mapped edge [2019-11-28 17:57:15,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [508] [508] L926-->L962: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#t~ret40_10| |v_t2Thread1of1ForFork1_get_top_#res_17|) (= v_~top~0_43 |v_t2Thread1of1ForFork1_get_top_#res_17|)) InVars {~top~0=v_~top~0_43} OutVars{t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_17|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_10|, ~top~0=v_~top~0_43} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-11-28 17:57:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [541] [541] L962-->L990-3: Formula: (let ((.cse0 (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 2147483648))) (.cse1 (<= |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 2147483647)) (.cse2 (mod (select (select |v_#memory_int_49| v_t2Thread1of1ForFork1_pop_~stack.base_13) (+ v_t2Thread1of1ForFork1_pop_~stack.offset_13 (* |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 4))) 4294967296)) (.cse3 (= |v_t2Thread1of1ForFork1_pop_#res_13| |v_t2Thread1of1ForFork1_#t~ret48_29|))) (or (and .cse0 .cse1 (= (+ |v_t2Thread1of1ForFork1_pop_#res_13| 4294967296) .cse2) (< 2147483647 .cse2) .cse3) (and .cse0 (<= .cse2 2147483647) .cse1 (= |v_t2Thread1of1ForFork1_pop_#res_13| .cse2) .cse3))) InVars {t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_13, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_19|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_13} OutVars{t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_13, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_13|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_16|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_18|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_13} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-11-28 17:57:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [556] [556] L990-3-->L985-6: Formula: (and (= t2Thread1of1ForFork1_~i~1_Out-2118267389 (+ t2Thread1of1ForFork1_~i~1_In-2118267389 1)) (not (= (- 2) |t2Thread1of1ForFork1_#t~ret48_In-2118267389|)) (<= 0 (+ |t2Thread1of1ForFork1_#t~ret48_In-2118267389| 2147483648)) (<= |t2Thread1of1ForFork1_#t~ret48_In-2118267389| 2147483647) (= |#pthreadsMutex_Out-2118267389| (store |#pthreadsMutex_In-2118267389| |~#m~0.base_In-2118267389| (store (select |#pthreadsMutex_In-2118267389| |~#m~0.base_In-2118267389|) |~#m~0.offset_In-2118267389| 0)))) InVars {#pthreadsMutex=|#pthreadsMutex_In-2118267389|, ~#m~0.base=|~#m~0.base_In-2118267389|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_In-2118267389|, ~#m~0.offset=|~#m~0.offset_In-2118267389|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_In-2118267389} OutVars{#pthreadsMutex=|#pthreadsMutex_Out-2118267389|, ~#m~0.base=|~#m~0.base_In-2118267389|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_Out-2118267389|, ~#m~0.offset=|~#m~0.offset_In-2118267389|, t2Thread1of1ForFork1_#t~post46=|t2Thread1of1ForFork1_#t~post46_Out-2118267389|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_Out-2118267389} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_#t~post46, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_5|) (< v_t2Thread1of1ForFork1_~i~1_10 5) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [558] [558] L987-1-->L990-3: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#res_28| |v_t2Thread1of1ForFork1_#t~ret48_48|) (= v_t2Thread1of1ForFork1_pop_~stack.offset_26 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|) (not (= 0 (mod v_~flag~0_53 256))) (= |v_~#arr~0.offset_35| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|) (= v_t2Thread1of1ForFork1_pop_~stack.base_26 |v_t2Thread1of1ForFork1_pop_#in~stack.base_20|) (= |v_~#arr~0.base_35| |v_t2Thread1of1ForFork1_pop_#in~stack.base_20|) (= |v_t2Thread1of1ForFork1_pop_#res_28| (- 2)) (= |v_t2Thread1of1ForFork1_get_top_#res_41| v_~top~0_133) (= 0 |v_t2Thread1of1ForFork1_get_top_#res_41|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_35|, ~flag~0=v_~flag~0_53, ~top~0=v_~top~0_133, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_46|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_26, ~#arr~0.offset=|v_~#arr~0.offset_35|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_48|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_28|, ~flag~0=v_~flag~0_53, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|, ~top~0=v_~top~0_133, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_45|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_41|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_30|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_40|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_18|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_20|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_26, ~#arr~0.base=|v_~#arr~0.base_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [506] [506] L990-3-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= (- 2) |v_t2Thread1of1ForFork1_#t~ret48_16|) InVars {t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_16|} OutVars{t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48] because there is no mapped edge [2019-11-28 17:57:15,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:57:15 BasicIcfg [2019-11-28 17:57:15,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:57:15,254 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:57:15,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:57:15,255 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:57:15,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:05" (3/4) ... [2019-11-28 17:57:15,259 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:57:15,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [560] [560] ULTIMATE.startENTRY-->L1001-1: Formula: (let ((.cse7 (store |v_#valid_63| 0 0))) (let ((.cse3 (store .cse7 |v_#t~string35.base_8| 1))) (let ((.cse4 (store .cse3 |v_#t~string39.base_8| 1))) (let ((.cse5 (store .cse4 |v_~#arr~0.base_45| 1))) (let ((.cse6 (store .cse5 |v_~#m~0.base_95| 1))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22| 1)) (.cse0 (select |v_#memory_int_72| |v_~#arr~0.base_45|)) (.cse1 (select |v_#memory_int_72| |v_~#m~0.base_95|))) (and (= |v_~#m~0.offset_95| 0) (< |v_#StackHeapBarrier_21| |v_~#m~0.base_95|) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_25|) (= |v_#NULL.offset_3| 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 (select .cse0 (+ |v_~#arr~0.offset_45| 4))) (= 0 (select .cse1 (+ |v_~#m~0.offset_95| 12))) (= (select .cse1 (+ |v_~#m~0.offset_95| 4)) 0) (< |v_#StackHeapBarrier_21| |v_#t~string35.base_8|) (< |v_#StackHeapBarrier_21| |v_#t~string39.base_8|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_19|) (= |v_#t~string35.offset_8| 0) (= (select .cse0 (+ |v_~#arr~0.offset_45| 16)) 0) (= (store |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22| (store (select |v_#memory_int_72| |v_ULTIMATE.start_main_~#id1~0.base_22|) |v_ULTIMATE.start_main_~#id1~0.offset_19| 0)) |v_#memory_int_71|) (= (select .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28|) 0) (= 0 |v_#t~string39.offset_8|) (= 0 |v_~#arr~0.offset_45|) (= (select .cse1 (+ |v_~#m~0.offset_95| 8)) 0) (= (select .cse0 (+ |v_~#arr~0.offset_45| 12)) 0) (= |v_#valid_61| (store .cse2 |v_ULTIMATE.start_main_~#id2~0.base_28| 1)) (= 0 (select .cse3 |v_#t~string39.base_8|)) (= 0 (select .cse1 |v_~#m~0.offset_95|)) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id1~0.base_22|) (= |v_#pthreadsMutex_212| (store |v_#pthreadsMutex_213| |v_~#m~0.base_95| (store (select |v_#pthreadsMutex_213| |v_~#m~0.base_95|) |v_~#m~0.offset_95| 0))) (= 0 (select .cse4 |v_~#arr~0.base_45|)) (= (select .cse0 (+ |v_~#arr~0.offset_45| 8)) 0) (= (select .cse0 |v_~#arr~0.offset_45|) 0) (= 0 |v_#NULL.base_3|) (= (select .cse5 |v_~#m~0.base_95|) 0) (= 0 v_~top~0_145) (= (select .cse6 |v_ULTIMATE.start_main_~#id1~0.base_22|) 0) (= (select .cse1 (+ |v_~#m~0.offset_95| 16)) 0) (= v_~flag~0_63 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#id2~0.base_28|) (< |v_#StackHeapBarrier_21| |v_~#arr~0.base_45|) (= (select .cse7 |v_#t~string35.base_8|) 0) (= |v_#length_41| (store (store (store (store (store (store |v_#length_43| |v_#t~string35.base_8| 16) |v_#t~string39.base_8| 17) |v_~#arr~0.base_45| 20) |v_~#m~0.base_95| 24) |v_ULTIMATE.start_main_~#id1~0.base_22| 4) |v_ULTIMATE.start_main_~#id2~0.base_28| 4))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_213|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_72|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_22|, #t~string35.offset=|v_#t~string35.offset_8|, ~flag~0=v_~flag~0_63, #t~string39.base=|v_#t~string39.base_8|, #NULL.offset=|v_#NULL.offset_3|, ~top~0=v_~top~0_145, ULTIMATE.start_main_#t~nondet50=|v_ULTIMATE.start_main_#t~nondet50_10|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_28|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_25|, #t~string39.offset=|v_#t~string39.offset_8|, #length=|v_#length_41|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_10|, ~#arr~0.base=|v_~#arr~0.base_45|, #pthreadsMutex=|v_#pthreadsMutex_212|, ~#arr~0.offset=|v_~#arr~0.offset_45|, ULTIMATE.start_main_#t~mem52=|v_ULTIMATE.start_main_#t~mem52_20|, ULTIMATE.start_main_#t~mem51=|v_ULTIMATE.start_main_#t~mem51_15|, #t~string35.base=|v_#t~string35.base_8|, #NULL.base=|v_#NULL.base_3|, ~#m~0.base=|v_~#m~0.base_95|, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ~#m~0.offset=|v_~#m~0.offset_95|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id1~0.base, #t~string35.offset, ~flag~0, #t~string39.base, #NULL.offset, ~top~0, ULTIMATE.start_main_#t~nondet50, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, #t~string39.offset, #length, ULTIMATE.start_main_#t~nondet49, ~#arr~0.base, #pthreadsMutex, ~#arr~0.offset, ULTIMATE.start_main_#t~mem52, ULTIMATE.start_main_#t~mem51, #t~string35.base, #NULL.base, ~#m~0.base, ~#m~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-11-28 17:57:15,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [467] [467] L1001-2-->L1002-1: Formula: (= (store |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10| (store (select |v_#memory_int_27| |v_ULTIMATE.start_main_~#id2~0.base_10|) |v_ULTIMATE.start_main_~#id2~0.offset_9| 1)) |v_#memory_int_26|) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_27|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_10|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_9|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_3|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet49] because there is no mapped edge [2019-11-28 17:57:15,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [502] [502] t2ENTRY-->L985-6: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_5| v_t2Thread1of1ForFork1_~arg.base_3) (= v_t2Thread1of1ForFork1_~i~1_16 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_5| v_t2Thread1of1ForFork1_~arg.offset_3)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_5|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_3, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_3, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_5|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_16} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [526] [526] t1ENTRY-->L970-6: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_5| v_t1Thread1of1ForFork0_~arg.offset_3) (= |v_t1Thread1of1ForFork0_#in~arg.base_5| v_t1Thread1of1ForFork0_~arg.base_3) (= v_t1Thread1of1ForFork0_~i~0_16 0)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_16, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_10, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_3, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_5|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_3, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~i~0, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [539] [539] L970-6-->L975: Formula: (let ((.cse0 (select |v_#pthreadsMutex_122| |v_~#m~0.base_58|))) (and (= 0 (select .cse0 |v_~#m~0.offset_58|)) (= |v_t1Thread1of1ForFork0_#t~nondet44_8| v_t1Thread1of1ForFork0_~tmp~0_11) (< v_t1Thread1of1ForFork0_~i~0_28 5) (not (= (ite (< (mod v_t1Thread1of1ForFork0_~tmp~0_11 4294967296) 5) 1 0) 0)) (= (store |v_#pthreadsMutex_122| |v_~#m~0.base_58| (store .cse0 |v_~#m~0.offset_58| 1)) |v_#pthreadsMutex_121|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_28, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_121|, ~#m~0.base=|v_~#m~0.base_58|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_28, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_11, ~#m~0.offset=|v_~#m~0.offset_58|, t1Thread1of1ForFork0_#t~nondet43=|v_t1Thread1of1ForFork0_#t~nondet43_22|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_7|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_#t~nondet43, t1Thread1of1ForFork0_#t~nondet44] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [546] [546] L975-->L932: Formula: (and (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_6| |v_~#arr~0.offset_20|) (= |v_t1Thread1of1ForFork0_push_#in~stack.offset_6| v_t1Thread1of1ForFork0_push_~stack.offset_17) (= |v_t1Thread1of1ForFork0_push_#in~x_20| (let ((.cse0 (mod v_t1Thread1of1ForFork0_~tmp~0_12 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (not (= 5 v_~top~0_94)) (= |v_t1Thread1of1ForFork0_push_#in~x_20| v_t1Thread1of1ForFork0_push_~x_31) (= |v_~#arr~0.base_20| |v_t1Thread1of1ForFork0_push_#in~stack.base_6|) (= |v_t1Thread1of1ForFork0_push_#in~stack.base_6| v_t1Thread1of1ForFork0_push_~stack.base_17)) InVars {~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, ~top~0=v_~top~0_94, ~#arr~0.base=|v_~#arr~0.base_20|} OutVars{t1Thread1of1ForFork0_push_#in~x=|v_t1Thread1of1ForFork0_push_#in~x_20|, ~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_17, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_20|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_30|, ~top~0=v_~top~0_94, t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_17, t1Thread1of1ForFork0_push_#in~stack.base=|v_t1Thread1of1ForFork0_push_#in~stack.base_6|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_31, t1Thread1of1ForFork0_push_#t~nondet34=|v_t1Thread1of1ForFork0_push_#t~nondet34_9|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_16|, t1Thread1of1ForFork0_push_#in~stack.offset=|v_t1Thread1of1ForFork0_push_#in~stack.offset_6|, ~#arr~0.base=|v_~#arr~0.base_20|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#in~x, t1Thread1of1ForFork0_push_~stack.base, t1Thread1of1ForFork0_push_#in~stack.base, t1Thread1of1ForFork0_push_~x, t1Thread1of1ForFork0_push_#t~nondet34, t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_~stack.offset, t1Thread1of1ForFork0_push_#res, t1Thread1of1ForFork0_push_#t~ret36, t1Thread1of1ForFork0_push_#in~stack.offset] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [490] [490] L932-->L947-1: Formula: (and (= |v_t1Thread1of1ForFork0_get_top_#res_6| |v_t1Thread1of1ForFork0_push_#t~ret36_8|) (= |v_t1Thread1of1ForFork0_get_top_#res_6| v_~top~0_33)) InVars {~top~0=v_~top~0_33} OutVars{t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_8|, ~top~0=v_~top~0_33} AuxVars[] AssignedVars[t1Thread1of1ForFork0_get_top_#res, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [503] [503] L947-1-->L948: Formula: (and (<= |v_t1Thread1of1ForFork0_push_#t~ret36_12| 2147483647) (= (store |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_9 (store (select |v_#memory_int_39| v_t1Thread1of1ForFork0_push_~stack.base_9) (+ v_t1Thread1of1ForFork0_push_~stack.offset_9 (* |v_t1Thread1of1ForFork0_push_#t~ret36_12| 4)) v_t1Thread1of1ForFork0_push_~x_10)) |v_#memory_int_38|) (<= 0 (+ |v_t1Thread1of1ForFork0_push_#t~ret36_12| 2147483648))) InVars {t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_9, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_10, #memory_int=|v_#memory_int_39|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_9, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_12|} OutVars{t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_9, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_10, #memory_int=|v_#memory_int_38|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_9, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_11|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [457] [457] L948-->L924-1: Formula: (= |v_t1Thread1of1ForFork0_inc_top_#t~post31_5| v_~top~0_11) InVars {~top~0=v_~top~0_11} OutVars{t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_5|, ~top~0=v_~top~0_11} AuxVars[] AssignedVars[t1Thread1of1ForFork0_inc_top_#t~post31] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [533] [533] L924-1-->L975-4: Formula: (and (= |v_t1Thread1of1ForFork0_#t~ret45_24| |v_t1Thread1of1ForFork0_push_#res_14|) (= (+ |v_t1Thread1of1ForFork0_inc_top_#t~post31_31| 1) v_~top~0_68) (= 0 |v_t1Thread1of1ForFork0_push_#res_14|)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_31|} OutVars{t1Thread1of1ForFork0_#t~ret45=|v_t1Thread1of1ForFork0_#t~ret45_24|, t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_30|, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_14|, ~top~0=v_~top~0_68} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, t1Thread1of1ForFork0_inc_top_#t~post31, t1Thread1of1ForFork0_push_#res, ~top~0] because there is no mapped edge [2019-11-28 17:57:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [532] [532] L975-4-->L978: Formula: (and (not (= (- 1) |t1Thread1of1ForFork0_#t~ret45_In-2138404180|)) (= 1 ~flag~0_Out-2138404180)) InVars {t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_In-2138404180|} OutVars{t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_Out-2138404180|, ~flag~0=~flag~0_Out-2138404180} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, ~flag~0] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [538] [538] L978-->L970-6: Formula: (and (= (+ v_t1Thread1of1ForFork0_~i~0_25 1) v_t1Thread1of1ForFork0_~i~0_24) (= (store |v_#pthreadsMutex_114| |v_~#m~0.base_55| (store (select |v_#pthreadsMutex_114| |v_~#m~0.base_55|) |v_~#m~0.offset_55| 0)) |v_#pthreadsMutex_113|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_114|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_25, ~#m~0.offset=|v_~#m~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_113|, ~#m~0.base=|v_~#m~0.base_55|, t1Thread1of1ForFork0_#t~post42=|v_t1Thread1of1ForFork0_#t~post42_7|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_24, ~#m~0.offset=|v_~#m~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~post42, t1Thread1of1ForFork0_~i~0] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_5|) (< v_t2Thread1of1ForFork1_~i~1_10 5) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [551] [551] L987-1-->L954-4: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| |v_t2Thread1of1ForFork1_get_top_#res_36|) (not (= (mod v_~flag~0_47 256) 0)) (= |v_t2Thread1of1ForFork1_get_top_#res_36| v_~top~0_126) (= v_t2Thread1of1ForFork1_pop_~stack.offset_19 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|) (= |v_~#arr~0.offset_29| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|) (= v_t2Thread1of1ForFork1_pop_~stack.base_19 |v_t2Thread1of1ForFork1_pop_#in~stack.base_17|) (= |v_~#arr~0.base_29| |v_t2Thread1of1ForFork1_pop_#in~stack.base_17|) (not (= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 0)) (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 2147483648)) (<= |v_t2Thread1of1ForFork1_pop_#t~ret37_42| 2147483647)) InVars {~#arr~0.offset=|v_~#arr~0.offset_29|, ~flag~0=v_~flag~0_47, ~top~0=v_~top~0_126, ~#arr~0.base=|v_~#arr~0.base_29|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_41|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_19, ~#arr~0.offset=|v_~#arr~0.offset_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_21|, ~flag~0=v_~flag~0_47, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_17|, ~top~0=v_~top~0_126, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_42|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_36|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_23|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_27|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_15|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_17|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_19, ~#arr~0.base=|v_~#arr~0.base_29|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [516] [516] L954-4-->L928-1: Formula: (= |v_t2Thread1of1ForFork1_dec_top_#t~post32_32| v_~top~0_55) InVars {~top~0=v_~top~0_55} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_32|, ~top~0=v_~top~0_55, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_16|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [487] [487] L928-1-->L926: Formula: (= v_~top~0_29 (+ |v_t2Thread1of1ForFork1_dec_top_#t~post32_13| (- 1))) InVars {t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_13|} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_12|, ~top~0=v_~top~0_29} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, ~top~0] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [508] [508] L926-->L962: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#t~ret40_10| |v_t2Thread1of1ForFork1_get_top_#res_17|) (= v_~top~0_43 |v_t2Thread1of1ForFork1_get_top_#res_17|)) InVars {~top~0=v_~top~0_43} OutVars{t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_17|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_10|, ~top~0=v_~top~0_43} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-11-28 17:57:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [541] [541] L962-->L990-3: Formula: (let ((.cse0 (<= 0 (+ |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 2147483648))) (.cse1 (<= |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 2147483647)) (.cse2 (mod (select (select |v_#memory_int_49| v_t2Thread1of1ForFork1_pop_~stack.base_13) (+ v_t2Thread1of1ForFork1_pop_~stack.offset_13 (* |v_t2Thread1of1ForFork1_pop_#t~ret40_19| 4))) 4294967296)) (.cse3 (= |v_t2Thread1of1ForFork1_pop_#res_13| |v_t2Thread1of1ForFork1_#t~ret48_29|))) (or (and .cse0 .cse1 (= (+ |v_t2Thread1of1ForFork1_pop_#res_13| 4294967296) .cse2) (< 2147483647 .cse2) .cse3) (and .cse0 (<= .cse2 2147483647) .cse1 (= |v_t2Thread1of1ForFork1_pop_#res_13| .cse2) .cse3))) InVars {t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_13, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_19|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_13} OutVars{t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_13, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_13|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_16|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_18|, #memory_int=|v_#memory_int_49|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_13} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40] because there is no mapped edge [2019-11-28 17:57:15,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [556] [556] L990-3-->L985-6: Formula: (and (= t2Thread1of1ForFork1_~i~1_Out-2118267389 (+ t2Thread1of1ForFork1_~i~1_In-2118267389 1)) (not (= (- 2) |t2Thread1of1ForFork1_#t~ret48_In-2118267389|)) (<= 0 (+ |t2Thread1of1ForFork1_#t~ret48_In-2118267389| 2147483648)) (<= |t2Thread1of1ForFork1_#t~ret48_In-2118267389| 2147483647) (= |#pthreadsMutex_Out-2118267389| (store |#pthreadsMutex_In-2118267389| |~#m~0.base_In-2118267389| (store (select |#pthreadsMutex_In-2118267389| |~#m~0.base_In-2118267389|) |~#m~0.offset_In-2118267389| 0)))) InVars {#pthreadsMutex=|#pthreadsMutex_In-2118267389|, ~#m~0.base=|~#m~0.base_In-2118267389|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_In-2118267389|, ~#m~0.offset=|~#m~0.offset_In-2118267389|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_In-2118267389} OutVars{#pthreadsMutex=|#pthreadsMutex_Out-2118267389|, ~#m~0.base=|~#m~0.base_In-2118267389|, t2Thread1of1ForFork1_#t~ret48=|t2Thread1of1ForFork1_#t~ret48_Out-2118267389|, ~#m~0.offset=|~#m~0.offset_In-2118267389|, t2Thread1of1ForFork1_#t~post46=|t2Thread1of1ForFork1_#t~post46_Out-2118267389|, t2Thread1of1ForFork1_~i~1=t2Thread1of1ForFork1_~i~1_Out-2118267389} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_#t~post46, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:15,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L985-6-->L987-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_24| |v_~#m~0.base_20|))) (and (= 0 |v_t2Thread1of1ForFork1_#t~nondet47_5|) (< v_t2Thread1of1ForFork1_~i~1_10 5) (= 0 (select .cse0 |v_~#m~0.offset_20|)) (= (store |v_#pthreadsMutex_24| |v_~#m~0.base_20| (store .cse0 |v_~#m~0.offset_20| 1)) |v_#pthreadsMutex_23|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_23|, ~#m~0.base=|v_~#m~0.base_20|, ~#m~0.offset=|v_~#m~0.offset_20|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_10} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:15,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [558] [558] L987-1-->L990-3: Formula: (and (= |v_t2Thread1of1ForFork1_pop_#res_28| |v_t2Thread1of1ForFork1_#t~ret48_48|) (= v_t2Thread1of1ForFork1_pop_~stack.offset_26 |v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|) (not (= 0 (mod v_~flag~0_53 256))) (= |v_~#arr~0.offset_35| |v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|) (= v_t2Thread1of1ForFork1_pop_~stack.base_26 |v_t2Thread1of1ForFork1_pop_#in~stack.base_20|) (= |v_~#arr~0.base_35| |v_t2Thread1of1ForFork1_pop_#in~stack.base_20|) (= |v_t2Thread1of1ForFork1_pop_#res_28| (- 2)) (= |v_t2Thread1of1ForFork1_get_top_#res_41| v_~top~0_133) (= 0 |v_t2Thread1of1ForFork1_get_top_#res_41|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_35|, ~flag~0=v_~flag~0_53, ~top~0=v_~top~0_133, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_46|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_26, ~#arr~0.offset=|v_~#arr~0.offset_35|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_48|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_28|, ~flag~0=v_~flag~0_53, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_20|, ~top~0=v_~top~0_133, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_45|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_41|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_30|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_40|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_18|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_20|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_26, ~#arr~0.base=|v_~#arr~0.base_35|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, t2Thread1of1ForFork1_pop_~stack.offset, t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_pop_#res, t2Thread1of1ForFork1_pop_#t~mem41, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_pop_#t~nondet38, t2Thread1of1ForFork1_pop_#in~stack.offset, t2Thread1of1ForFork1_pop_#in~stack.base, t2Thread1of1ForFork1_pop_~stack.base, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:15,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [506] [506] L990-3-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= (- 2) |v_t2Thread1of1ForFork1_#t~ret48_16|) InVars {t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_16|} OutVars{t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48] because there is no mapped edge [2019-11-28 17:57:15,333 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:57:15,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:57:15,336 INFO L168 Benchmark]: Toolchain (without parser) took 11863.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.6 MB). Free memory was 956.3 MB in the beginning and 958.5 MB in the end (delta: -2.2 MB). Peak memory consumption was 324.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:15,336 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:15,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:15,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:15,339 INFO L168 Benchmark]: Boogie Preprocessor took 91.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:15,343 INFO L168 Benchmark]: RCFGBuilder took 845.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:15,348 INFO L168 Benchmark]: TraceAbstraction took 9840.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.0 GB in the beginning and 967.9 MB in the end (delta: 65.2 MB). Peak memory consumption was 256.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:15,348 INFO L168 Benchmark]: Witness Printer took 79.39 ms. Allocated memory is still 1.4 GB. Free memory was 967.9 MB in the beginning and 958.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:15,353 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 876.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 845.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9840.40 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.0 GB in the beginning and 967.9 MB in the end (delta: 65.2 MB). Peak memory consumption was 256.0 MB. Max. memory is 11.5 GB. * Witness Printer took 79.39 ms. Allocated memory is still 1.4 GB. Free memory was 967.9 MB in the beginning and 958.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 140 ProgramPointsBefore, 40 ProgramPointsAfterwards, 144 TransitionsBefore, 41 TransitionsAfterwards, 5952 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 4 ChoiceCompositions, 3254 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 8014 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 919]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1001] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, m={2:0}, top=0] [L1002] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, m={2:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 134 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 401 SDtfs, 436 SDslu, 1160 SDs, 0 SdLazy, 724 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 899 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 11866 SizeOfPredicates, 5 NumberOfNonLiveVariables, 333 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 6/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...