./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack_longer-1.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_longer-1.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 1891bb638db5c84e8fa01d5309bc212f15b49e23 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 1891bb638db5c84e8fa01d5309bc212f15b49e23 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:57:02,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:57:02,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:57:02,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:57:02,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:57:02,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:57:02,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:57:02,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:57:02,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:57:02,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:57:02,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:57:02,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:57:02,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:57:02,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:57:02,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:57:02,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:57:02,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:57:02,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:57:02,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:57:02,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:57:02,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:57:02,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:57:02,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:57:02,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:57:02,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:57:02,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:57:02,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:57:02,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:57:02,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:57:02,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:57:02,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:57:02,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:57:02,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:57:02,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:57:02,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:57:02,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:57:02,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:57:02,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:57:02,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:57:02,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:57:02,291 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,308 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:57:02,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:57:02,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:57:02,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:57:02,310 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:57:02,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:57:02,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:57:02,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:57:02,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:57:02,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:57:02,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:57:02,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:57:02,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:57:02,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:57:02,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:57:02,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:57:02,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:57:02,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:57:02,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:57:02,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:57:02,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:57:02,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:02,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:57:02,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:57:02,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:57:02,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:57:02,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:57:02,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:57:02,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:57:02,316 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 -> 1891bb638db5c84e8fa01d5309bc212f15b49e23 [2019-11-28 17:57:02,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:57:02,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:57:02,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:57:02,666 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:57:02,668 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:57:02,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2019-11-28 17:57:02,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a4a03dc/298224116df742399739803a23831436/FLAG8eead07d0 [2019-11-28 17:57:03,330 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:57:03,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2019-11-28 17:57:03,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a4a03dc/298224116df742399739803a23831436/FLAG8eead07d0 [2019-11-28 17:57:03,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3a4a03dc/298224116df742399739803a23831436 [2019-11-28 17:57:03,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:57:03,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:57:03,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:03,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:57:03,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:57:03,586 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,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 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,589 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,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:57:03,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:57:04,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:04,234 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:57:04,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:04,467 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:57:04,468 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,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:04,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:04,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:57:04,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:57:04,480 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,520 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,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:04,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:57:04,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:57:04,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:57:04,562 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,562 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,567 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,567 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,578 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,584 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,586 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,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:57:04,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:57:04,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:57:04,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:57:04,593 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,656 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-28 17:57:04,657 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-28 17:57:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-28 17:57:04,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-28 17:57:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:57:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:57:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:57:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:57:04,659 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-28 17:57:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:57:04,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:57:04,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:57:04,663 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,238 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:57:05,240 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-28 17:57:05,242 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,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:57:05,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:57:05,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:57:05,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:57:05,248 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,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d105d5e 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,250 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,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d105d5e 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,251 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,253 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2019-11-28 17:57:05,264 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:57:05,264 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:57:05,273 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:57:05,274 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:57:05,324 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,324 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,324 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,325 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,325 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,325 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,325 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,326 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,326 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,326 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,326 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,327 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,327 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,327 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,327 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,327 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,328 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,328 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,328 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,328 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,329 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,329 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,329 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,329 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,329 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,330 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,330 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,330 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,330 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,330 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,331 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,331 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,331 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,331 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,332 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,332 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,332 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,332 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,333 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,333 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,333 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,333 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,334 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,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,334 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,334 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,334 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,335 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,335 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,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,335 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,336 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,336 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,336 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,336 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,337 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,337 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,337 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,338 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,338 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,338 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,339 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,339 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,340 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,340 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,340 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,340 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,341 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,341 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,341 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,341 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,342 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,342 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,342 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,342 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,343 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,343 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,343 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,343 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,343 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,344 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,344 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,344 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,344 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,345 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,345 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,345 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,345 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,345 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,346 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,346 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,346 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,346 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,347 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,347 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,347 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,348 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,348 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,348 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,348 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,348 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,349 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,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,349 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,349 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,350 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,350 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,350 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,351 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,351 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,351 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,351 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,352 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,352 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,352 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,352 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,352 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,353 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,353 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,353 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,353 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,354 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,354 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:05,354 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,354 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,381 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 17:57:05,399 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:57:05,399 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:57:05,399 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:57:05,399 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:57:05,399 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:57:05,399 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:57:05,400 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:57:05,400 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:57:05,415 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 140 transitions [2019-11-28 17:57:05,417 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 140 transitions [2019-11-28 17:57:05,492 INFO L134 PetriNetUnfolder]: 10/140 cut-off events. [2019-11-28 17:57:05,492 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:05,504 INFO L76 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 140 events. 10/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs. 19/148 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-11-28 17:57:05,517 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 140 transitions [2019-11-28 17:57:05,555 INFO L134 PetriNetUnfolder]: 10/140 cut-off events. [2019-11-28 17:57:05,556 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:05,560 INFO L76 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 140 events. 10/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs. 19/148 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2019-11-28 17:57:05,571 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5952 [2019-11-28 17:57:05,572 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:57:07,317 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-28 17:57:08,293 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-28 17:57:08,418 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 17:57:09,129 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-11-28 17:57:09,340 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-28 17:57:09,384 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6690 [2019-11-28 17:57:09,385 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-11-28 17:57:09,389 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 41 transitions [2019-11-28 17:57:09,421 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 335 states. [2019-11-28 17:57:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-11-28 17:57:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 17:57:09,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:09,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 17:57:09,433 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:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -229309141, now seen corresponding path program 1 times [2019-11-28 17:57:09,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:09,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132523955] [2019-11-28 17:57:09,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:09,672 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:09,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132523955] [2019-11-28 17:57:09,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:09,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:09,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272304338] [2019-11-28 17:57:09,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:09,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:09,693 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 3 states. [2019-11-28 17:57:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:09,763 INFO L93 Difference]: Finished difference Result 529 states and 1334 transitions. [2019-11-28 17:57:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:09,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 17:57:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:09,788 INFO L225 Difference]: With dead ends: 529 [2019-11-28 17:57:09,788 INFO L226 Difference]: Without dead ends: 507 [2019-11-28 17:57:09,790 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:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-28 17:57:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 467. [2019-11-28 17:57:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-11-28 17:57:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1235 transitions. [2019-11-28 17:57:09,879 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1235 transitions. Word has length 6 [2019-11-28 17:57:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:09,880 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 1235 transitions. [2019-11-28 17:57:09,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1235 transitions. [2019-11-28 17:57:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:57:09,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:09,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:09,882 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:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:09,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1069650288, now seen corresponding path program 1 times [2019-11-28 17:57:09,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:09,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-28 17:57:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:09,959 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:09,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722800454] [2019-11-28 17:57:09,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:09,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:09,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434524962] [2019-11-28 17:57:09,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:09,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:09,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:09,963 INFO L87 Difference]: Start difference. First operand 467 states and 1235 transitions. Second operand 3 states. [2019-11-28 17:57:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:09,983 INFO L93 Difference]: Finished difference Result 574 states and 1482 transitions. [2019-11-28 17:57:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:09,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 17:57:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:09,989 INFO L225 Difference]: With dead ends: 574 [2019-11-28 17:57:09,989 INFO L226 Difference]: Without dead ends: 552 [2019-11-28 17:57:09,990 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:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-11-28 17:57:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 512. [2019-11-28 17:57:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-28 17:57:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1362 transitions. [2019-11-28 17:57:10,026 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1362 transitions. Word has length 8 [2019-11-28 17:57:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:10,029 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1362 transitions. [2019-11-28 17:57:10,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1362 transitions. [2019-11-28 17:57:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:57:10,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:10,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:10,032 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:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash -174077442, now seen corresponding path program 1 times [2019-11-28 17:57:10,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:10,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820945892] [2019-11-28 17:57:10,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:10,126 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:10,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820945892] [2019-11-28 17:57:10,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:10,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:57:10,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052633718] [2019-11-28 17:57:10,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:10,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:10,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:10,129 INFO L87 Difference]: Start difference. First operand 512 states and 1362 transitions. Second operand 3 states. [2019-11-28 17:57:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:10,143 INFO L93 Difference]: Finished difference Result 544 states and 1443 transitions. [2019-11-28 17:57:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:10,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 17:57:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:10,151 INFO L225 Difference]: With dead ends: 544 [2019-11-28 17:57:10,152 INFO L226 Difference]: Without dead ends: 544 [2019-11-28 17:57:10,152 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:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-28 17:57:10,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-11-28 17:57:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-28 17:57:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1443 transitions. [2019-11-28 17:57:10,174 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1443 transitions. Word has length 10 [2019-11-28 17:57:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:10,175 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1443 transitions. [2019-11-28 17:57:10,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1443 transitions. [2019-11-28 17:57:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:57:10,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:10,182 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:10,182 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:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 763111477, now seen corresponding path program 1 times [2019-11-28 17:57:10,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:10,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513466971] [2019-11-28 17:57:10,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:10,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513466971] [2019-11-28 17:57:10,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252071486] [2019-11-28 17:57:10,278 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:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:10,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:57:10,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:10,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:10,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 17:57:10,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436798882] [2019-11-28 17:57:10,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:57:10,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:57:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:57:10,413 INFO L87 Difference]: Start difference. First operand 544 states and 1443 transitions. Second operand 7 states. [2019-11-28 17:57:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:10,494 INFO L93 Difference]: Finished difference Result 821 states and 2103 transitions. [2019-11-28 17:57:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:57:10,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 17:57:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:10,500 INFO L225 Difference]: With dead ends: 821 [2019-11-28 17:57:10,501 INFO L226 Difference]: Without dead ends: 821 [2019-11-28 17:57:10,501 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:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-11-28 17:57:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 668. [2019-11-28 17:57:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-11-28 17:57:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1762 transitions. [2019-11-28 17:57:10,524 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1762 transitions. Word has length 14 [2019-11-28 17:57:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:10,524 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 1762 transitions. [2019-11-28 17:57:10,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:57:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1762 transitions. [2019-11-28 17:57:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:57:10,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:10,526 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:10,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:57:10,731 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:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 277758940, now seen corresponding path program 1 times [2019-11-28 17:57:10,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:10,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 17:57:10,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:10,783 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:10,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978486459] [2019-11-28 17:57:10,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:10,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:57:10,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813310678] [2019-11-28 17:57:10,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:10,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:10,785 INFO L87 Difference]: Start difference. First operand 668 states and 1762 transitions. Second operand 3 states. [2019-11-28 17:57:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:10,809 INFO L93 Difference]: Finished difference Result 359 states and 809 transitions. [2019-11-28 17:57:10,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 17:57:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:10,812 INFO L225 Difference]: With dead ends: 359 [2019-11-28 17:57:10,812 INFO L226 Difference]: Without dead ends: 355 [2019-11-28 17:57:10,812 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:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-28 17:57:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 335. [2019-11-28 17:57:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-28 17:57:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 751 transitions. [2019-11-28 17:57:10,823 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 751 transitions. Word has length 16 [2019-11-28 17:57:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:10,824 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 751 transitions. [2019-11-28 17:57:10,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 751 transitions. [2019-11-28 17:57:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:57:10,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:10,828 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:10,828 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:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1401799518, now seen corresponding path program 1 times [2019-11-28 17:57:10,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:10,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349326934] [2019-11-28 17:57:10,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:10,917 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:10,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349326934] [2019-11-28 17:57:10,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:10,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:57:10,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910468266] [2019-11-28 17:57:10,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:57:10,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:57:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:57:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:57:10,920 INFO L87 Difference]: Start difference. First operand 335 states and 751 transitions. Second operand 5 states. [2019-11-28 17:57:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:11,018 INFO L93 Difference]: Finished difference Result 445 states and 993 transitions. [2019-11-28 17:57:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:57:11,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 17:57:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:11,022 INFO L225 Difference]: With dead ends: 445 [2019-11-28 17:57:11,022 INFO L226 Difference]: Without dead ends: 445 [2019-11-28 17:57:11,023 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:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-28 17:57:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 373. [2019-11-28 17:57:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-28 17:57:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 842 transitions. [2019-11-28 17:57:11,036 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 842 transitions. Word has length 17 [2019-11-28 17:57:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:11,037 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 842 transitions. [2019-11-28 17:57:11,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:57:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 842 transitions. [2019-11-28 17:57:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:57:11,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:11,039 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:11,040 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:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:11,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1964448312, now seen corresponding path program 1 times [2019-11-28 17:57:11,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:57:11,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646825451] [2019-11-28 17:57:11,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:57:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:11,196 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 17:57:11,201 INFO L168 Benchmark]: Toolchain (without parser) took 7620.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 956.3 MB in the beginning and 803.2 MB in the end (delta: 153.2 MB). Peak memory consumption was 354.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:11,202 INFO L168 Benchmark]: CDTParser took 0.86 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:11,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 888.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -95.1 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:11,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:11,204 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:11,205 INFO L168 Benchmark]: RCFGBuilder took 650.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:11,205 INFO L168 Benchmark]: TraceAbstraction took 5955.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.0 GB in the beginning and 803.2 MB in the end (delta: 201.8 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:11,209 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.86 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 888.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -95.1 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 650.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5955.90 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.0 GB in the beginning and 803.2 MB in the end (delta: 201.8 MB). Peak memory consumption was 286.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 136 ProgramPointsBefore, 39 ProgramPointsAfterwards, 140 TransitionsBefore, 41 TransitionsAfterwards, 5952 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 3242 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 6690 CheckedPairsTotal, 119 TotalNumberOfCompositions - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 17:57:13,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:57:13,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:57:13,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:57:13,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:57:13,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:57:13,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:57:13,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:57:13,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:57:13,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:57:13,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:57:13,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:57:13,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:57:13,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:57:13,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:57:13,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:57:13,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:57:13,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:57:13,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:57:13,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:57:13,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:57:13,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:57:13,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:57:13,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:57:13,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:57:13,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:57:13,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:57:13,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:57:13,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:57:13,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:57:13,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:57:13,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:57:13,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:57:13,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:57:13,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:57:13,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:57:13,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:57:13,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:57:13,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:57:13,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:57:13,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:57:13,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 17:57:13,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:57:13,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:57:13,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:57:13,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:57:13,189 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:57:13,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:57:13,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:57:13,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:57:13,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:57:13,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:57:13,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:57:13,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:57:13,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 17:57:13,192 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 17:57:13,192 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:57:13,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:57:13,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:57:13,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:57:13,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:57:13,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:57:13,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:57:13,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:57:13,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:57:13,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:57:13,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:57:13,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:57:13,195 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 17:57:13,195 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 17:57:13,196 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:57:13,196 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:57:13,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 17:57:13,197 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 1891bb638db5c84e8fa01d5309bc212f15b49e23 [2019-11-28 17:57:13,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:57:13,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:57:13,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:57:13,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:57:13,527 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:57:13,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2019-11-28 17:57:13,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7360c039/e5c17e819fad4bc19ddb06971b3f3c3d/FLAGd33b71c5a [2019-11-28 17:57:14,111 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:57:14,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2019-11-28 17:57:14,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7360c039/e5c17e819fad4bc19ddb06971b3f3c3d/FLAGd33b71c5a [2019-11-28 17:57:14,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7360c039/e5c17e819fad4bc19ddb06971b3f3c3d [2019-11-28 17:57:14,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:57:14,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:57:14,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:14,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:57:14,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:57:14,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b91e3a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:14, skipping insertion in model container [2019-11-28 17:57:14,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:57:14" (1/1) ... [2019-11-28 17:57:14,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:57:14,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:57:15,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:15,186 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:57:15,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:57:15,500 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:57:15,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:15 WrapperNode [2019-11-28 17:57:15,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:57:15,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:15,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:57:15,503 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:57:15,512 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:15" (1/1) ... [2019-11-28 17:57:15,557 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:15" (1/1) ... [2019-11-28 17:57:15,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:57:15,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:57:15,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:57:15,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:57:15,621 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:15" (1/1) ... [2019-11-28 17:57:15,621 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:15" (1/1) ... [2019-11-28 17:57:15,634 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:15" (1/1) ... [2019-11-28 17:57:15,635 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:15" (1/1) ... [2019-11-28 17:57:15,657 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:15" (1/1) ... [2019-11-28 17:57:15,662 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:15" (1/1) ... [2019-11-28 17:57:15,665 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:15" (1/1) ... [2019-11-28 17:57:15,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:57:15,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:57:15,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:57:15,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:57:15,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:15" (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:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 17:57:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-28 17:57:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-28 17:57:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-28 17:57:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-28 17:57:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:57:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:57:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 17:57:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-28 17:57:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-28 17:57:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:57:15,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:57:15,731 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:16,315 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:57:16,315 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-28 17:57:16,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:16 BoogieIcfgContainer [2019-11-28 17:57:16,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:57:16,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:57:16,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:57:16,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:57:16,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:57:14" (1/3) ... [2019-11-28 17:57:16,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265c19f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:16, skipping insertion in model container [2019-11-28 17:57:16,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:57:15" (2/3) ... [2019-11-28 17:57:16,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265c19f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:57:16, skipping insertion in model container [2019-11-28 17:57:16,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:57:16" (3/3) ... [2019-11-28 17:57:16,334 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2019-11-28 17:57:16,347 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 17:57:16,347 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:57:16,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 17:57:16,359 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 17:57:16,417 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,417 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,419 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,419 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,419 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,420 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,420 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,420 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,422 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,423 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,423 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:16,424 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:16,424 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,424 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,425 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,425 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,426 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,426 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:16,426 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:16,427 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,427 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,427 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,428 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,429 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,429 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,431 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,432 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,432 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,433 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,433 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,434 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,435 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,435 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,436 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,436 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:16,437 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:16,437 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,437 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,438 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:16,438 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,438 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,439 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:16,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,442 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,443 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,443 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,443 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,446 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,446 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,447 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,447 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,448 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,448 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,448 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,449 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,449 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:16,449 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:16,450 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,450 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,450 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,451 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,452 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,452 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,453 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,453 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,453 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,455 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,455 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,456 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:16,456 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:16,456 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,456 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,457 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,457 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,457 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,458 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,462 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,463 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,464 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,464 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,464 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,465 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,465 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:16,465 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,467 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:16,467 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,467 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,468 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:16,477 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,477 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,478 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:16,478 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,478 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,479 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,482 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,482 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,482 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,482 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 17:57:16,519 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 17:57:16,543 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:57:16,543 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:57:16,543 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:57:16,543 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:57:16,544 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:57:16,544 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:57:16,544 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:57:16,544 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:57:16,569 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions [2019-11-28 17:57:16,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions [2019-11-28 17:57:16,677 INFO L134 PetriNetUnfolder]: 10/136 cut-off events. [2019-11-28 17:57:16,678 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:16,688 INFO L76 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 136 events. 10/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 394 event pairs. 19/144 useless extension candidates. Maximal degree in co-relation 103. Up to 3 conditions per place. [2019-11-28 17:57:16,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions [2019-11-28 17:57:16,736 INFO L134 PetriNetUnfolder]: 10/136 cut-off events. [2019-11-28 17:57:16,736 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 17:57:16,740 INFO L76 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 136 events. 10/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 394 event pairs. 19/144 useless extension candidates. Maximal degree in co-relation 103. Up to 3 conditions per place. [2019-11-28 17:57:16,750 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5420 [2019-11-28 17:57:16,752 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 17:57:17,804 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-28 17:57:18,032 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-11-28 17:57:19,372 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-28 17:57:19,527 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 17:57:20,749 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 17:57:20,937 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 17:57:21,818 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-28 17:57:22,265 WARN L192 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-28 17:57:22,314 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6183 [2019-11-28 17:57:22,315 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-11-28 17:57:22,318 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 40 transitions [2019-11-28 17:57:22,351 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 335 states. [2019-11-28 17:57:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states. [2019-11-28 17:57:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 17:57:22,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:22,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 17:57:22,362 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:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -842765210, now seen corresponding path program 1 times [2019-11-28 17:57:22,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:22,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915278260] [2019-11-28 17:57:22,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:22,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 17:57:22,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:22,529 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:22,529 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:22,541 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:22,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915278260] [2019-11-28 17:57:22,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:22,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-28 17:57:22,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806116936] [2019-11-28 17:57:22,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:57:22,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:57:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:57:22,564 INFO L87 Difference]: Start difference. First operand 335 states. Second operand 4 states. [2019-11-28 17:57:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:22,759 INFO L93 Difference]: Finished difference Result 694 states and 1781 transitions. [2019-11-28 17:57:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:57:22,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-28 17:57:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:22,806 INFO L225 Difference]: With dead ends: 694 [2019-11-28 17:57:22,806 INFO L226 Difference]: Without dead ends: 672 [2019-11-28 17:57:22,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:57:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-28 17:57:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 427. [2019-11-28 17:57:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-28 17:57:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1148 transitions. [2019-11-28 17:57:22,948 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1148 transitions. Word has length 6 [2019-11-28 17:57:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:22,948 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 1148 transitions. [2019-11-28 17:57:22,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:57:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1148 transitions. [2019-11-28 17:57:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 17:57:22,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:22,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:23,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 17:57:23,169 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:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -492949241, now seen corresponding path program 1 times [2019-11-28 17:57:23,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:23,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029884375] [2019-11-28 17:57:23,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:23,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 17:57:23,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:23,254 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:23,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:23,255 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:23,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029884375] [2019-11-28 17:57:23,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:23,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 17:57:23,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048556635] [2019-11-28 17:57:23,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:23,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:23,259 INFO L87 Difference]: Start difference. First operand 427 states and 1148 transitions. Second operand 3 states. [2019-11-28 17:57:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:23,307 INFO L93 Difference]: Finished difference Result 583 states and 1521 transitions. [2019-11-28 17:57:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:23,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 17:57:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:23,312 INFO L225 Difference]: With dead ends: 583 [2019-11-28 17:57:23,313 INFO L226 Difference]: Without dead ends: 561 [2019-11-28 17:57:23,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-11-28 17:57:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 496. [2019-11-28 17:57:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-11-28 17:57:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1335 transitions. [2019-11-28 17:57:23,333 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1335 transitions. Word has length 8 [2019-11-28 17:57:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:23,334 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 1335 transitions. [2019-11-28 17:57:23,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1335 transitions. [2019-11-28 17:57:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:57:23,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:23,335 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:23,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 17:57:23,549 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:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1100234069, now seen corresponding path program 1 times [2019-11-28 17:57:23,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:23,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116597070] [2019-11-28 17:57:23,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:23,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 17:57:23,639 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:23,645 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:23,646 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:23,660 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:23,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116597070] [2019-11-28 17:57:23,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:23,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-28 17:57:23,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940508866] [2019-11-28 17:57:23,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:57:23,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:57:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:57:23,663 INFO L87 Difference]: Start difference. First operand 496 states and 1335 transitions. Second operand 4 states. [2019-11-28 17:57:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:23,691 INFO L93 Difference]: Finished difference Result 548 states and 1474 transitions. [2019-11-28 17:57:23,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:23,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 17:57:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:23,697 INFO L225 Difference]: With dead ends: 548 [2019-11-28 17:57:23,697 INFO L226 Difference]: Without dead ends: 548 [2019-11-28 17:57:23,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:57:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-11-28 17:57:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-11-28 17:57:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-28 17:57:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1474 transitions. [2019-11-28 17:57:23,725 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1474 transitions. Word has length 10 [2019-11-28 17:57:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:23,725 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1474 transitions. [2019-11-28 17:57:23,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:57:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1474 transitions. [2019-11-28 17:57:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:57:23,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:23,734 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:57:23,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 17:57:23,950 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:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:23,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1177084603, now seen corresponding path program 1 times [2019-11-28 17:57:23,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:23,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888277655] [2019-11-28 17:57:23,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:24,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:57:24,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:24,082 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:57:24,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888277655] [2019-11-28 17:57:24,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:57:24,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-28 17:57:24,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208198123] [2019-11-28 17:57:24,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:57:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:57:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:57:24,128 INFO L87 Difference]: Start difference. First operand 548 states and 1474 transitions. Second operand 8 states. [2019-11-28 17:57:24,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:24,500 INFO L93 Difference]: Finished difference Result 1747 states and 4543 transitions. [2019-11-28 17:57:24,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:57:24,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-28 17:57:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:24,514 INFO L225 Difference]: With dead ends: 1747 [2019-11-28 17:57:24,514 INFO L226 Difference]: Without dead ends: 1747 [2019-11-28 17:57:24,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:57:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-11-28 17:57:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1271. [2019-11-28 17:57:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-11-28 17:57:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 3473 transitions. [2019-11-28 17:57:24,570 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 3473 transitions. Word has length 14 [2019-11-28 17:57:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:24,571 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 3473 transitions. [2019-11-28 17:57:24,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:57:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 3473 transitions. [2019-11-28 17:57:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 17:57:24,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:24,574 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] [2019-11-28 17:57:24,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 17:57:24,787 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:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 380576355, now seen corresponding path program 1 times [2019-11-28 17:57:24,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:24,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613064307] [2019-11-28 17:57:24,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:24,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 17:57:24,932 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:24,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 17:57:24,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:57:24,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:57:24,993 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:57:24,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 17:57:25,005 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:25,005 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:25,019 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:25,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613064307] [2019-11-28 17:57:25,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:25,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 17:57:25,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278704] [2019-11-28 17:57:25,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:57:25,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:57:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:57:25,021 INFO L87 Difference]: Start difference. First operand 1271 states and 3473 transitions. Second operand 3 states. [2019-11-28 17:57:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:25,067 INFO L93 Difference]: Finished difference Result 562 states and 1283 transitions. [2019-11-28 17:57:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:57:25,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 17:57:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:25,072 INFO L225 Difference]: With dead ends: 562 [2019-11-28 17:57:25,072 INFO L226 Difference]: Without dead ends: 550 [2019-11-28 17:57:25,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 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:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-11-28 17:57:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 458. [2019-11-28 17:57:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-28 17:57:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1029 transitions. [2019-11-28 17:57:25,096 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1029 transitions. Word has length 20 [2019-11-28 17:57:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:25,096 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 1029 transitions. [2019-11-28 17:57:25,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:57:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1029 transitions. [2019-11-28 17:57:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:57:25,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:25,098 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:25,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 17:57:25,318 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:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash 211214539, now seen corresponding path program 1 times [2019-11-28 17:57:25,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:25,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618083810] [2019-11-28 17:57:25,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:57:25,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 17:57:25,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:57:25,496 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 17:57:25,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:57:25,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:57:25,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:57:25,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-28 17:57:25,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 17:57:25,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:57:25,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:57:25,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:57:25,739 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 17:57:25,775 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:25,775 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:57:26,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2019-11-28 17:57:26,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 17:57:26,440 INFO L614 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2019-11-28 17:57:26,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 17:57:26,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:21 [2019-11-28 17:57:26,706 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:26,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618083810] [2019-11-28 17:57:26,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:57:26,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 22 [2019-11-28 17:57:26,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432395057] [2019-11-28 17:57:26,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 17:57:26,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:57:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 17:57:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:57:26,712 INFO L87 Difference]: Start difference. First operand 458 states and 1029 transitions. Second operand 23 states. [2019-11-28 17:57:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:57:33,388 INFO L93 Difference]: Finished difference Result 1258 states and 2763 transitions. [2019-11-28 17:57:33,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-28 17:57:33,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-11-28 17:57:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:57:33,399 INFO L225 Difference]: With dead ends: 1258 [2019-11-28 17:57:33,400 INFO L226 Difference]: Without dead ends: 1258 [2019-11-28 17:57:33,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=517, Invalid=3265, Unknown=0, NotChecked=0, Total=3782 [2019-11-28 17:57:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-11-28 17:57:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 594. [2019-11-28 17:57:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-28 17:57:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1407 transitions. [2019-11-28 17:57:33,449 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1407 transitions. Word has length 21 [2019-11-28 17:57:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:57:33,449 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 1407 transitions. [2019-11-28 17:57:33,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 17:57:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1407 transitions. [2019-11-28 17:57:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:57:33,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:57:33,451 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:33,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 17:57:33,652 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:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:57:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash 167210285, now seen corresponding path program 1 times [2019-11-28 17:57:33,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:57:33,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483521] [2019-11-28 17:57:33,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 17:57:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:57:33,989 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 17:57:33,989 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:57:34,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 17:57:34,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [526] [526] ULTIMATE.startENTRY-->L999-1: Formula: (let ((.cse0 (store |v_#valid_63| (_ bv0 32) (_ bv0 1)))) (let ((.cse1 (store .cse0 |v_#t~string35.base_6| (_ bv1 1)))) (let ((.cse7 (store .cse1 |v_#t~string39.base_6| (_ bv1 1)))) (let ((.cse3 (store .cse7 |v_~#arr~0.base_37| (_ bv1 1)))) (let ((.cse2 (store |v_#memory_int_69| |v_~#arr~0.base_37| ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (.cse4 (store .cse3 |v_~#m~0.base_88| (_ bv1 1)))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_main_~#id1~0.base_21| (_ bv1 1))) (.cse6 (select .cse2 |v_~#m~0.base_88|))) (and (= (select .cse0 |v_#t~string35.base_6|) (_ bv0 1)) (bvult |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#id2~0.base_23|) (= |v_#NULL.base_6| (_ bv0 32)) (= (_ bv0 1) (select .cse1 |v_#t~string39.base_6|)) (= (_ bv0 32) |v_#NULL.offset_6|) (= |v_#memory_int_67| (store .cse2 |v_ULTIMATE.start_main_~#id1~0.base_21| (store (select .cse2 |v_ULTIMATE.start_main_~#id1~0.base_21|) |v_ULTIMATE.start_main_~#id1~0.offset_18| (_ bv0 32)))) (= |v_ULTIMATE.start_main_~#id1~0.offset_18| (_ bv0 32)) (= (_ bv0 1) (select .cse3 |v_~#m~0.base_88|)) (= |v_#t~string39.offset_6| (_ bv0 32)) (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~#id1~0.base_21|)) (bvult |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#id1~0.base_21|) (= (select .cse5 |v_ULTIMATE.start_main_~#id2~0.base_23|) (_ bv0 1)) (= (_ bv0 32) |v_#t~string35.offset_6|) (bvult (_ bv0 32) |v_#StackHeapBarrier_22|) (= (_ bv0 32) |v_~#m~0.offset_88|) (= |v_~#arr~0.offset_34| (_ bv0 32)) (= |v_#length_41| (store (store (store (store (store (store |v_#length_43| |v_#t~string35.base_6| (_ bv16 32)) |v_#t~string39.base_6| (_ bv17 32)) |v_~#arr~0.base_37| (_ bv1600 32)) |v_~#m~0.base_88| (_ bv24 32)) |v_ULTIMATE.start_main_~#id1~0.base_21| (_ bv4 32)) |v_ULTIMATE.start_main_~#id2~0.base_23| (_ bv4 32))) (= (_ bv0 32) (select .cse6 |v_~#m~0.offset_88|)) (bvult |v_#StackHeapBarrier_22| |v_~#arr~0.base_37|) (= |v_#valid_61| (store .cse5 |v_ULTIMATE.start_main_~#id2~0.base_23| (_ bv1 1))) (= (_ bv0 32) (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv12 32)))) (= (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv8 32))) (_ bv0 32)) (= (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv16 32))) (_ bv0 32)) (= (_ bv0 8) v_~flag~0_50) (= |v_ULTIMATE.start_main_~#id2~0.offset_20| (_ bv0 32)) (= (_ bv0 1) (select .cse7 |v_~#arr~0.base_37|)) (= |v_#pthreadsMutex_195| (store |v_#pthreadsMutex_196| |v_~#m~0.base_88| (store (select |v_#pthreadsMutex_196| |v_~#m~0.base_88|) |v_~#m~0.offset_88| (_ bv0 1)))) (bvult |v_#StackHeapBarrier_22| |v_#t~string39.base_6|) (bvult |v_#StackHeapBarrier_22| |v_#t~string35.base_6|) (= roundNearestTiesToEven v_currentRoundingMode_6) (bvult |v_#StackHeapBarrier_22| |v_~#m~0.base_88|) (= (_ bv0 32) (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv4 32)))) (= v_~top~0_100 (_ bv0 32))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_196|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_69|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_21|, #t~string35.offset=|v_#t~string35.offset_6|, ~flag~0=v_~flag~0_50, #t~string39.base=|v_#t~string39.base_6|, #NULL.offset=|v_#NULL.offset_6|, ~top~0=v_~top~0_100, ULTIMATE.start_main_#t~nondet50=|v_ULTIMATE.start_main_#t~nondet50_8|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_23|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_20|, #t~string39.offset=|v_#t~string39.offset_6|, #length=|v_#length_41|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_8|, ~#arr~0.base=|v_~#arr~0.base_37|, #pthreadsMutex=|v_#pthreadsMutex_195|, ~#arr~0.offset=|v_~#arr~0.offset_34|, ULTIMATE.start_main_#t~mem52=|v_ULTIMATE.start_main_#t~mem52_16|, ULTIMATE.start_main_#t~mem51=|v_ULTIMATE.start_main_#t~mem51_13|, #t~string35.base=|v_#t~string35.base_6|, #NULL.base=|v_#NULL.base_6|, ~#m~0.base=|v_~#m~0.base_88|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~#m~0.offset=|v_~#m~0.offset_88|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_18|, currentRoundingMode=v_currentRoundingMode_6} 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, currentRoundingMode] because there is no mapped edge [2019-11-28 17:57:34,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [432] [432] L999-2-->L1000-1: Formula: (= |v_#memory_int_22| (store |v_#memory_int_23| |v_ULTIMATE.start_main_~#id2~0.base_8| (store (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#id2~0.base_8|) |v_ULTIMATE.start_main_~#id2~0.offset_8| (_ bv1 32)))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_8|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_8|, #memory_int=|v_#memory_int_23|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_8|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_8|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet49] because there is no mapped edge [2019-11-28 17:57:34,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [501] [501] t2ENTRY-->L983-6: Formula: (and (= (_ bv0 32) v_t2Thread1of1ForFork1_~i~1_23) (= v_t2Thread1of1ForFork1_~arg.base_2 |v_t2Thread1of1ForFork1_#in~arg.base_4|) (= v_t2Thread1of1ForFork1_~arg.offset_2 |v_t2Thread1of1ForFork1_#in~arg.offset_4|)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_2, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_2, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_23} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] t1ENTRY-->L968-6: Formula: (and (= (_ bv0 32) v_t1Thread1of1ForFork0_~i~0_30) (= v_t1Thread1of1ForFork0_~arg.offset_2 |v_t1Thread1of1ForFork0_#in~arg.offset_4|) (= v_t1Thread1of1ForFork0_~arg.base_2 |v_t1Thread1of1ForFork0_#in~arg.base_4|)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_30, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_2, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_2, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} 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:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L968-6-->L971-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#m~0.base_38|))) (and (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#m~0.base_38| (store .cse0 |v_~#m~0.offset_38| (_ bv1 1)))) (= (select .cse0 |v_~#m~0.offset_38|) (_ bv0 1)) (bvslt v_t1Thread1of1ForFork0_~i~0_29 (_ bv400 32)) (= v_t1Thread1of1ForFork0_~tmp~0_10 |v_t1Thread1of1ForFork0_#t~nondet44_5|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, ~#m~0.base=|v_~#m~0.base_38|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_29, ~#m~0.offset=|v_~#m~0.offset_38|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, ~#m~0.base=|v_~#m~0.base_38|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_29, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_10, ~#m~0.offset=|v_~#m~0.offset_38|, t1Thread1of1ForFork0_#t~nondet43=|v_t1Thread1of1ForFork0_#t~nondet43_13|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_5|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_#t~nondet43] because there is no mapped edge [2019-11-28 17:57:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [518] [518] L971-1-->L945: Formula: (and (= |v_t1Thread1of1ForFork0_push_#in~stack.base_9| v_t1Thread1of1ForFork0_push_~stack.base_20) (= v_t1Thread1of1ForFork0_~tmp~0_20 |v_t1Thread1of1ForFork0_push_#in~x_14|) (= |v_~#arr~0.offset_20| |v_t1Thread1of1ForFork0_push_#in~stack.offset_9|) (= |v_t1Thread1of1ForFork0_push_#in~stack.base_9| |v_~#arr~0.base_23|) (not (= (ite (bvult v_t1Thread1of1ForFork0_~tmp~0_20 (_ bv400 32)) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= |v_t1Thread1of1ForFork0_push_#in~x_14| v_t1Thread1of1ForFork0_push_~x_27) (= v_t1Thread1of1ForFork0_push_~stack.offset_20 |v_t1Thread1of1ForFork0_push_#in~stack.offset_9|) (not (= v_~top~0_86 (_ bv400 32)))) InVars {~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_20, ~top~0=v_~top~0_86, ~#arr~0.base=|v_~#arr~0.base_23|} OutVars{t1Thread1of1ForFork0_push_#in~x=|v_t1Thread1of1ForFork0_push_#in~x_14|, ~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_20, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_26|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_26|, ~top~0=v_~top~0_86, t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_20, t1Thread1of1ForFork0_push_#in~stack.base=|v_t1Thread1of1ForFork0_push_#in~stack.base_9|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_20, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_27, t1Thread1of1ForFork0_push_#t~nondet34=|v_t1Thread1of1ForFork0_push_#t~nondet34_11|, t1Thread1of1ForFork0_push_#in~stack.offset=|v_t1Thread1of1ForFork0_push_#in~stack.offset_9|, ~#arr~0.base=|v_~#arr~0.base_23|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_14|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#in~x, t1Thread1of1ForFork0_push_~stack.base, t1Thread1of1ForFork0_push_#in~stack.base, t1Thread1of1ForFork0_push_~x, t1Thread1of1ForFork0_push_#t~nondet34, t1Thread1of1ForFork0_push_~stack.offset, t1Thread1of1ForFork0_push_#res, t1Thread1of1ForFork0_push_#t~ret36, t1Thread1of1ForFork0_push_#in~stack.offset, t1Thread1of1ForFork0_#t~nondet44] because there is no mapped edge [2019-11-28 17:57:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [419] [419] L945-->L930-1: Formula: (= v_~top~0_17 |v_t1Thread1of1ForFork0_get_top_#res_4|) InVars {~top~0=v_~top~0_17} OutVars{t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_4|, ~top~0=v_~top~0_17} AuxVars[] AssignedVars[t1Thread1of1ForFork0_get_top_#res] because there is no mapped edge [2019-11-28 17:57:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L930-1-->L945-2: Formula: (and (= (store |v_#memory_int_25| v_t1Thread1of1ForFork0_push_~stack.base_6 (store (select |v_#memory_int_25| v_t1Thread1of1ForFork0_push_~stack.base_6) (bvadd (bvmul |v_t1Thread1of1ForFork0_push_#t~ret36_8| (_ bv4 32)) v_t1Thread1of1ForFork0_push_~stack.offset_6) v_t1Thread1of1ForFork0_push_~x_8)) |v_#memory_int_24|) (= |v_t1Thread1of1ForFork0_push_#t~ret36_8| |v_t1Thread1of1ForFork0_get_top_#res_6|)) InVars {t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_6, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_8, #memory_int=|v_#memory_int_25|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_6} OutVars{t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_6, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_8, #memory_int=|v_#memory_int_24|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_6, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_8|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:34,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L945-2-->L922-1: Formula: (= v_~top~0_44 |v_t1Thread1of1ForFork0_inc_top_#t~post31_24|) InVars {~top~0=v_~top~0_44} OutVars{t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_24|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_10|, ~top~0=v_~top~0_44} AuxVars[] AssignedVars[t1Thread1of1ForFork0_inc_top_#t~post31, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [474] [474] L922-1-->L973-3: Formula: (and (= |v_t1Thread1of1ForFork0_#t~ret45_11| |v_t1Thread1of1ForFork0_push_#res_7|) (= v_~top~0_41 (bvadd |v_t1Thread1of1ForFork0_inc_top_#t~post31_23| (_ bv1 32))) (= (_ bv0 32) |v_t1Thread1of1ForFork0_push_#res_7|)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_23|} OutVars{t1Thread1of1ForFork0_#t~ret45=|v_t1Thread1of1ForFork0_#t~ret45_11|, t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_22|, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_7|, ~top~0=v_~top~0_41} 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:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [516] [516] L973-3-->L976: Formula: (and (not (= |t1Thread1of1ForFork0_#t~ret45_In278667498| (_ bv4294967295 32))) (= (_ bv1 8) ~flag~0_Out278667498)) InVars {t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_In278667498|} OutVars{t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_Out278667498|, ~flag~0=~flag~0_Out278667498} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, ~flag~0] because there is no mapped edge [2019-11-28 17:57:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [480] [480] L976-->L968-6: Formula: (and (= (bvadd v_t1Thread1of1ForFork0_~i~0_15 (_ bv1 32)) v_t1Thread1of1ForFork0_~i~0_14) (= |v_#pthreadsMutex_34| (store |v_#pthreadsMutex_35| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_35| |v_~#m~0.base_25|) |v_~#m~0.offset_25| (_ bv0 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_25|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_15, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_34|, ~#m~0.base=|v_~#m~0.base_25|, t1Thread1of1ForFork0_#t~post42=|v_t1Thread1of1ForFork0_#t~post42_9|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_14, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~post42, t1Thread1of1ForFork0_~i~0] because there is no mapped edge [2019-11-28 17:57:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L983-6-->L985-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m~0.base_12|))) (and (= (select .cse0 |v_~#m~0.offset_12|) (_ bv0 1)) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#m~0.base_12| (store .cse0 |v_~#m~0.offset_12| (_ bv1 1)))) (bvslt v_t2Thread1of1ForFork1_~i~1_12 (_ bv400 32)) (= |v_t2Thread1of1ForFork1_#t~nondet47_5| (_ bv0 32)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [524] [524] L985-1-->L952-1: Formula: (and (not (= (_ bv0 8) v_~flag~0_48)) (= v_~top~0_98 |v_t2Thread1of1ForFork1_get_top_#res_29|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_18| v_t2Thread1of1ForFork1_pop_~stack.offset_24) (= |v_t2Thread1of1ForFork1_pop_#in~stack.base_18| |v_~#arr~0.base_35|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_18| |v_~#arr~0.offset_32|) (= v_t2Thread1of1ForFork1_pop_~stack.base_24 |v_t2Thread1of1ForFork1_pop_#in~stack.base_18|) (= |v_t2Thread1of1ForFork1_get_top_#res_29| |v_t2Thread1of1ForFork1_pop_#t~ret37_37|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_32|, ~flag~0=v_~flag~0_48, ~top~0=v_~top~0_98, ~#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_24, ~#arr~0.offset=|v_~#arr~0.offset_32|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_32|, ~flag~0=v_~flag~0_48, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_18|, ~top~0=v_~top~0_98, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_37|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_29|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_27|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_37|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_13|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_18|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_24, ~#arr~0.base=|v_~#arr~0.base_35|} 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:34,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [481] [481] L952-1-->L926-1: Formula: (and (= v_~top~0_43 |v_t2Thread1of1ForFork1_dec_top_#t~post32_18|) (not (= (_ bv0 32) |v_t2Thread1of1ForFork1_pop_#t~ret37_16|))) InVars {~top~0=v_~top~0_43, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_16|} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_18|, ~top~0=v_~top~0_43, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:34,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [483] [483] L926-2-->L960: Formula: (and (= v_~top~0_45 |v_t2Thread1of1ForFork1_get_top_#res_14|) (= |v_t2Thread1of1ForFork1_get_top_#res_14| |v_t2Thread1of1ForFork1_pop_#t~ret40_11|)) InVars {~top~0=v_~top~0_45} OutVars{t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_14|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_11|, t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_19|, ~top~0=v_~top~0_45} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_dec_top_#t~post32] because there is no mapped edge [2019-11-28 17:57:34,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [515] [515] L960-->L988-3: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret48_29| |v_t2Thread1of1ForFork1_pop_#res_22|) (= (select (select |v_#memory_int_50| v_t2Thread1of1ForFork1_pop_~stack.base_15) (bvadd (bvmul |v_t2Thread1of1ForFork1_pop_#t~ret40_24| (_ bv4 32)) v_t2Thread1of1ForFork1_pop_~stack.offset_15)) |v_t2Thread1of1ForFork1_pop_#res_22|)) InVars {t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_24|, #memory_int=|v_#memory_int_50|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} OutVars{t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_22|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_17|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_23|, #memory_int=|v_#memory_int_50|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} 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:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [522] [522] L988-3-->L983-6: Formula: (and (not (= |v_t2Thread1of1ForFork1_#t~ret48_42| (_ bv4294967294 32))) (= (store |v_#pthreadsMutex_162| |v_~#m~0.base_76| (store (select |v_#pthreadsMutex_162| |v_~#m~0.base_76|) |v_~#m~0.offset_76| (_ bv0 1))) |v_#pthreadsMutex_161|) (= (bvadd v_t2Thread1of1ForFork1_~i~1_57 (_ bv1 32)) v_t2Thread1of1ForFork1_~i~1_56)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#m~0.base=|v_~#m~0.base_76|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_42|, ~#m~0.offset=|v_~#m~0.offset_76|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_57} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, ~#m~0.base=|v_~#m~0.base_76|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_41|, ~#m~0.offset=|v_~#m~0.offset_76|, t2Thread1of1ForFork1_#t~post46=|v_t2Thread1of1ForFork1_#t~post46_17|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_56} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_#t~post46, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L983-6-->L985-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m~0.base_12|))) (and (= (select .cse0 |v_~#m~0.offset_12|) (_ bv0 1)) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#m~0.base_12| (store .cse0 |v_~#m~0.offset_12| (_ bv1 1)))) (bvslt v_t2Thread1of1ForFork1_~i~1_12 (_ bv400 32)) (= |v_t2Thread1of1ForFork1_#t~nondet47_5| (_ bv0 32)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [525] [525] L985-1-->L988-3: Formula: (and (not (= (_ bv0 8) v_~flag~0_49)) (= |v_t2Thread1of1ForFork1_get_top_#res_31| (_ bv0 32)) (= |v_t2Thread1of1ForFork1_pop_#in~stack.base_19| |v_~#arr~0.base_36|) (= v_t2Thread1of1ForFork1_pop_~stack.base_25 |v_t2Thread1of1ForFork1_pop_#in~stack.base_19|) (= v_~top~0_99 |v_t2Thread1of1ForFork1_get_top_#res_31|) (= |v_t2Thread1of1ForFork1_#t~ret48_49| |v_t2Thread1of1ForFork1_pop_#res_33|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19| |v_~#arr~0.offset_33|) (= |v_t2Thread1of1ForFork1_pop_#res_33| (_ bv4294967294 32)) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19| v_t2Thread1of1ForFork1_pop_~stack.offset_25)) InVars {~#arr~0.offset=|v_~#arr~0.offset_33|, ~flag~0=v_~flag~0_49, ~top~0=v_~top~0_99, ~#arr~0.base=|v_~#arr~0.base_36|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_47|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_25, ~#arr~0.offset=|v_~#arr~0.offset_33|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_49|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_33|, ~flag~0=v_~flag~0_49, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_19|, ~top~0=v_~top~0_99, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_39|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_31|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_28|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_38|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_14|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_19|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_25, ~#arr~0.base=|v_~#arr~0.base_36|} 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:34,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [471] [471] L988-3-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= |v_t2Thread1of1ForFork1_#t~ret48_12| (_ bv4294967294 32)) InVars {t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_12|} OutVars{t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48] because there is no mapped edge [2019-11-28 17:57:34,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:57:34 BasicIcfg [2019-11-28 17:57:34,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:57:34,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:57:34,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:57:34,222 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:57:34,222 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:16" (3/4) ... [2019-11-28 17:57:34,224 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:57:34,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [526] [526] ULTIMATE.startENTRY-->L999-1: Formula: (let ((.cse0 (store |v_#valid_63| (_ bv0 32) (_ bv0 1)))) (let ((.cse1 (store .cse0 |v_#t~string35.base_6| (_ bv1 1)))) (let ((.cse7 (store .cse1 |v_#t~string39.base_6| (_ bv1 1)))) (let ((.cse3 (store .cse7 |v_~#arr~0.base_37| (_ bv1 1)))) (let ((.cse2 (store |v_#memory_int_69| |v_~#arr~0.base_37| ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (.cse4 (store .cse3 |v_~#m~0.base_88| (_ bv1 1)))) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_main_~#id1~0.base_21| (_ bv1 1))) (.cse6 (select .cse2 |v_~#m~0.base_88|))) (and (= (select .cse0 |v_#t~string35.base_6|) (_ bv0 1)) (bvult |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#id2~0.base_23|) (= |v_#NULL.base_6| (_ bv0 32)) (= (_ bv0 1) (select .cse1 |v_#t~string39.base_6|)) (= (_ bv0 32) |v_#NULL.offset_6|) (= |v_#memory_int_67| (store .cse2 |v_ULTIMATE.start_main_~#id1~0.base_21| (store (select .cse2 |v_ULTIMATE.start_main_~#id1~0.base_21|) |v_ULTIMATE.start_main_~#id1~0.offset_18| (_ bv0 32)))) (= |v_ULTIMATE.start_main_~#id1~0.offset_18| (_ bv0 32)) (= (_ bv0 1) (select .cse3 |v_~#m~0.base_88|)) (= |v_#t~string39.offset_6| (_ bv0 32)) (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~#id1~0.base_21|)) (bvult |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#id1~0.base_21|) (= (select .cse5 |v_ULTIMATE.start_main_~#id2~0.base_23|) (_ bv0 1)) (= (_ bv0 32) |v_#t~string35.offset_6|) (bvult (_ bv0 32) |v_#StackHeapBarrier_22|) (= (_ bv0 32) |v_~#m~0.offset_88|) (= |v_~#arr~0.offset_34| (_ bv0 32)) (= |v_#length_41| (store (store (store (store (store (store |v_#length_43| |v_#t~string35.base_6| (_ bv16 32)) |v_#t~string39.base_6| (_ bv17 32)) |v_~#arr~0.base_37| (_ bv1600 32)) |v_~#m~0.base_88| (_ bv24 32)) |v_ULTIMATE.start_main_~#id1~0.base_21| (_ bv4 32)) |v_ULTIMATE.start_main_~#id2~0.base_23| (_ bv4 32))) (= (_ bv0 32) (select .cse6 |v_~#m~0.offset_88|)) (bvult |v_#StackHeapBarrier_22| |v_~#arr~0.base_37|) (= |v_#valid_61| (store .cse5 |v_ULTIMATE.start_main_~#id2~0.base_23| (_ bv1 1))) (= (_ bv0 32) (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv12 32)))) (= (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv8 32))) (_ bv0 32)) (= (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv16 32))) (_ bv0 32)) (= (_ bv0 8) v_~flag~0_50) (= |v_ULTIMATE.start_main_~#id2~0.offset_20| (_ bv0 32)) (= (_ bv0 1) (select .cse7 |v_~#arr~0.base_37|)) (= |v_#pthreadsMutex_195| (store |v_#pthreadsMutex_196| |v_~#m~0.base_88| (store (select |v_#pthreadsMutex_196| |v_~#m~0.base_88|) |v_~#m~0.offset_88| (_ bv0 1)))) (bvult |v_#StackHeapBarrier_22| |v_#t~string39.base_6|) (bvult |v_#StackHeapBarrier_22| |v_#t~string35.base_6|) (= roundNearestTiesToEven v_currentRoundingMode_6) (bvult |v_#StackHeapBarrier_22| |v_~#m~0.base_88|) (= (_ bv0 32) (select .cse6 (bvadd |v_~#m~0.offset_88| (_ bv4 32)))) (= v_~top~0_100 (_ bv0 32))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_196|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_69|, #length=|v_#length_43|} OutVars{ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_21|, #t~string35.offset=|v_#t~string35.offset_6|, ~flag~0=v_~flag~0_50, #t~string39.base=|v_#t~string39.base_6|, #NULL.offset=|v_#NULL.offset_6|, ~top~0=v_~top~0_100, ULTIMATE.start_main_#t~nondet50=|v_ULTIMATE.start_main_#t~nondet50_8|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_23|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_20|, #t~string39.offset=|v_#t~string39.offset_6|, #length=|v_#length_41|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_8|, ~#arr~0.base=|v_~#arr~0.base_37|, #pthreadsMutex=|v_#pthreadsMutex_195|, ~#arr~0.offset=|v_~#arr~0.offset_34|, ULTIMATE.start_main_#t~mem52=|v_ULTIMATE.start_main_#t~mem52_16|, ULTIMATE.start_main_#t~mem51=|v_ULTIMATE.start_main_#t~mem51_13|, #t~string35.base=|v_#t~string35.base_6|, #NULL.base=|v_#NULL.base_6|, ~#m~0.base=|v_~#m~0.base_88|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~#m~0.offset=|v_~#m~0.offset_88|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_18|, currentRoundingMode=v_currentRoundingMode_6} 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, currentRoundingMode] because there is no mapped edge [2019-11-28 17:57:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [432] [432] L999-2-->L1000-1: Formula: (= |v_#memory_int_22| (store |v_#memory_int_23| |v_ULTIMATE.start_main_~#id2~0.base_8| (store (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#id2~0.base_8|) |v_ULTIMATE.start_main_~#id2~0.offset_8| (_ bv1 32)))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_8|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_8|, #memory_int=|v_#memory_int_23|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_8|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_8|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_4|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~nondet49] because there is no mapped edge [2019-11-28 17:57:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [501] [501] t2ENTRY-->L983-6: Formula: (and (= (_ bv0 32) v_t2Thread1of1ForFork1_~i~1_23) (= v_t2Thread1of1ForFork1_~arg.base_2 |v_t2Thread1of1ForFork1_#in~arg.base_4|) (= v_t2Thread1of1ForFork1_~arg.offset_2 |v_t2Thread1of1ForFork1_#in~arg.offset_4|)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_2, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_2, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_23} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [511] [511] t1ENTRY-->L968-6: Formula: (and (= (_ bv0 32) v_t1Thread1of1ForFork0_~i~0_30) (= v_t1Thread1of1ForFork0_~arg.offset_2 |v_t1Thread1of1ForFork0_#in~arg.offset_4|) (= v_t1Thread1of1ForFork0_~arg.base_2 |v_t1Thread1of1ForFork0_#in~arg.base_4|)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_30, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_12, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_2, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_2, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} 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:34,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [497] [497] L968-6-->L971-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_70| |v_~#m~0.base_38|))) (and (= |v_#pthreadsMutex_69| (store |v_#pthreadsMutex_70| |v_~#m~0.base_38| (store .cse0 |v_~#m~0.offset_38| (_ bv1 1)))) (= (select .cse0 |v_~#m~0.offset_38|) (_ bv0 1)) (bvslt v_t1Thread1of1ForFork0_~i~0_29 (_ bv400 32)) (= v_t1Thread1of1ForFork0_~tmp~0_10 |v_t1Thread1of1ForFork0_#t~nondet44_5|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_70|, ~#m~0.base=|v_~#m~0.base_38|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_29, ~#m~0.offset=|v_~#m~0.offset_38|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_69|, ~#m~0.base=|v_~#m~0.base_38|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_29, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_10, ~#m~0.offset=|v_~#m~0.offset_38|, t1Thread1of1ForFork0_#t~nondet43=|v_t1Thread1of1ForFork0_#t~nondet43_13|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_5|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_~tmp~0, t1Thread1of1ForFork0_#t~nondet43] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [518] [518] L971-1-->L945: Formula: (and (= |v_t1Thread1of1ForFork0_push_#in~stack.base_9| v_t1Thread1of1ForFork0_push_~stack.base_20) (= v_t1Thread1of1ForFork0_~tmp~0_20 |v_t1Thread1of1ForFork0_push_#in~x_14|) (= |v_~#arr~0.offset_20| |v_t1Thread1of1ForFork0_push_#in~stack.offset_9|) (= |v_t1Thread1of1ForFork0_push_#in~stack.base_9| |v_~#arr~0.base_23|) (not (= (ite (bvult v_t1Thread1of1ForFork0_~tmp~0_20 (_ bv400 32)) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= |v_t1Thread1of1ForFork0_push_#in~x_14| v_t1Thread1of1ForFork0_push_~x_27) (= v_t1Thread1of1ForFork0_push_~stack.offset_20 |v_t1Thread1of1ForFork0_push_#in~stack.offset_9|) (not (= v_~top~0_86 (_ bv400 32)))) InVars {~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_20, ~top~0=v_~top~0_86, ~#arr~0.base=|v_~#arr~0.base_23|} OutVars{t1Thread1of1ForFork0_push_#in~x=|v_t1Thread1of1ForFork0_push_#in~x_14|, ~#arr~0.offset=|v_~#arr~0.offset_20|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_20, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_26|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_26|, ~top~0=v_~top~0_86, t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_20, t1Thread1of1ForFork0_push_#in~stack.base=|v_t1Thread1of1ForFork0_push_#in~stack.base_9|, t1Thread1of1ForFork0_~tmp~0=v_t1Thread1of1ForFork0_~tmp~0_20, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_27, t1Thread1of1ForFork0_push_#t~nondet34=|v_t1Thread1of1ForFork0_push_#t~nondet34_11|, t1Thread1of1ForFork0_push_#in~stack.offset=|v_t1Thread1of1ForFork0_push_#in~stack.offset_9|, ~#arr~0.base=|v_~#arr~0.base_23|, t1Thread1of1ForFork0_#t~nondet44=|v_t1Thread1of1ForFork0_#t~nondet44_14|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_push_#in~x, t1Thread1of1ForFork0_push_~stack.base, t1Thread1of1ForFork0_push_#in~stack.base, t1Thread1of1ForFork0_push_~x, t1Thread1of1ForFork0_push_#t~nondet34, t1Thread1of1ForFork0_push_~stack.offset, t1Thread1of1ForFork0_push_#res, t1Thread1of1ForFork0_push_#t~ret36, t1Thread1of1ForFork0_push_#in~stack.offset, t1Thread1of1ForFork0_#t~nondet44] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [419] [419] L945-->L930-1: Formula: (= v_~top~0_17 |v_t1Thread1of1ForFork0_get_top_#res_4|) InVars {~top~0=v_~top~0_17} OutVars{t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_4|, ~top~0=v_~top~0_17} AuxVars[] AssignedVars[t1Thread1of1ForFork0_get_top_#res] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [443] [443] L930-1-->L945-2: Formula: (and (= (store |v_#memory_int_25| v_t1Thread1of1ForFork0_push_~stack.base_6 (store (select |v_#memory_int_25| v_t1Thread1of1ForFork0_push_~stack.base_6) (bvadd (bvmul |v_t1Thread1of1ForFork0_push_#t~ret36_8| (_ bv4 32)) v_t1Thread1of1ForFork0_push_~stack.offset_6) v_t1Thread1of1ForFork0_push_~x_8)) |v_#memory_int_24|) (= |v_t1Thread1of1ForFork0_push_#t~ret36_8| |v_t1Thread1of1ForFork0_get_top_#res_6|)) InVars {t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_6, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_8, #memory_int=|v_#memory_int_25|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_6} OutVars{t1Thread1of1ForFork0_push_~stack.base=v_t1Thread1of1ForFork0_push_~stack.base_6, t1Thread1of1ForFork0_push_~x=v_t1Thread1of1ForFork0_push_~x_8, #memory_int=|v_#memory_int_24|, t1Thread1of1ForFork0_get_top_#res=|v_t1Thread1of1ForFork0_get_top_#res_6|, t1Thread1of1ForFork0_push_~stack.offset=v_t1Thread1of1ForFork0_push_~stack.offset_6, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_8|} AuxVars[] AssignedVars[#memory_int, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [482] [482] L945-2-->L922-1: Formula: (= v_~top~0_44 |v_t1Thread1of1ForFork0_inc_top_#t~post31_24|) InVars {~top~0=v_~top~0_44} OutVars{t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_24|, t1Thread1of1ForFork0_push_#t~ret36=|v_t1Thread1of1ForFork0_push_#t~ret36_10|, ~top~0=v_~top~0_44} AuxVars[] AssignedVars[t1Thread1of1ForFork0_inc_top_#t~post31, t1Thread1of1ForFork0_push_#t~ret36] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [474] [474] L922-1-->L973-3: Formula: (and (= |v_t1Thread1of1ForFork0_#t~ret45_11| |v_t1Thread1of1ForFork0_push_#res_7|) (= v_~top~0_41 (bvadd |v_t1Thread1of1ForFork0_inc_top_#t~post31_23| (_ bv1 32))) (= (_ bv0 32) |v_t1Thread1of1ForFork0_push_#res_7|)) InVars {t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_23|} OutVars{t1Thread1of1ForFork0_#t~ret45=|v_t1Thread1of1ForFork0_#t~ret45_11|, t1Thread1of1ForFork0_inc_top_#t~post31=|v_t1Thread1of1ForFork0_inc_top_#t~post31_22|, t1Thread1of1ForFork0_push_#res=|v_t1Thread1of1ForFork0_push_#res_7|, ~top~0=v_~top~0_41} 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:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [516] [516] L973-3-->L976: Formula: (and (not (= |t1Thread1of1ForFork0_#t~ret45_In278667498| (_ bv4294967295 32))) (= (_ bv1 8) ~flag~0_Out278667498)) InVars {t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_In278667498|} OutVars{t1Thread1of1ForFork0_#t~ret45=|t1Thread1of1ForFork0_#t~ret45_Out278667498|, ~flag~0=~flag~0_Out278667498} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~ret45, ~flag~0] because there is no mapped edge [2019-11-28 17:57:34,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [480] [480] L976-->L968-6: Formula: (and (= (bvadd v_t1Thread1of1ForFork0_~i~0_15 (_ bv1 32)) v_t1Thread1of1ForFork0_~i~0_14) (= |v_#pthreadsMutex_34| (store |v_#pthreadsMutex_35| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_35| |v_~#m~0.base_25|) |v_~#m~0.offset_25| (_ bv0 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_25|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_15, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_34|, ~#m~0.base=|v_~#m~0.base_25|, t1Thread1of1ForFork0_#t~post42=|v_t1Thread1of1ForFork0_#t~post42_9|, t1Thread1of1ForFork0_~i~0=v_t1Thread1of1ForFork0_~i~0_14, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t1Thread1of1ForFork0_#t~post42, t1Thread1of1ForFork0_~i~0] because there is no mapped edge [2019-11-28 17:57:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L983-6-->L985-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m~0.base_12|))) (and (= (select .cse0 |v_~#m~0.offset_12|) (_ bv0 1)) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#m~0.base_12| (store .cse0 |v_~#m~0.offset_12| (_ bv1 1)))) (bvslt v_t2Thread1of1ForFork1_~i~1_12 (_ bv400 32)) (= |v_t2Thread1of1ForFork1_#t~nondet47_5| (_ bv0 32)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [524] [524] L985-1-->L952-1: Formula: (and (not (= (_ bv0 8) v_~flag~0_48)) (= v_~top~0_98 |v_t2Thread1of1ForFork1_get_top_#res_29|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_18| v_t2Thread1of1ForFork1_pop_~stack.offset_24) (= |v_t2Thread1of1ForFork1_pop_#in~stack.base_18| |v_~#arr~0.base_35|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_18| |v_~#arr~0.offset_32|) (= v_t2Thread1of1ForFork1_pop_~stack.base_24 |v_t2Thread1of1ForFork1_pop_#in~stack.base_18|) (= |v_t2Thread1of1ForFork1_get_top_#res_29| |v_t2Thread1of1ForFork1_pop_#t~ret37_37|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_32|, ~flag~0=v_~flag~0_48, ~top~0=v_~top~0_98, ~#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_24, ~#arr~0.offset=|v_~#arr~0.offset_32|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_32|, ~flag~0=v_~flag~0_48, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_18|, ~top~0=v_~top~0_98, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_37|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_29|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_27|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_37|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_13|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_18|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_24, ~#arr~0.base=|v_~#arr~0.base_35|} 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:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [481] [481] L952-1-->L926-1: Formula: (and (= v_~top~0_43 |v_t2Thread1of1ForFork1_dec_top_#t~post32_18|) (not (= (_ bv0 32) |v_t2Thread1of1ForFork1_pop_#t~ret37_16|))) InVars {~top~0=v_~top~0_43, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_16|} OutVars{t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_18|, ~top~0=v_~top~0_43, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_15|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_dec_top_#t~post32, t2Thread1of1ForFork1_pop_#t~ret37] because there is no mapped edge [2019-11-28 17:57:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [483] [483] L926-2-->L960: Formula: (and (= v_~top~0_45 |v_t2Thread1of1ForFork1_get_top_#res_14|) (= |v_t2Thread1of1ForFork1_get_top_#res_14| |v_t2Thread1of1ForFork1_pop_#t~ret40_11|)) InVars {~top~0=v_~top~0_45} OutVars{t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_14|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_11|, t2Thread1of1ForFork1_dec_top_#t~post32=|v_t2Thread1of1ForFork1_dec_top_#t~post32_19|, ~top~0=v_~top~0_45} AuxVars[] AssignedVars[t2Thread1of1ForFork1_get_top_#res, t2Thread1of1ForFork1_pop_#t~ret40, t2Thread1of1ForFork1_dec_top_#t~post32] because there is no mapped edge [2019-11-28 17:57:34,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [515] [515] L960-->L988-3: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret48_29| |v_t2Thread1of1ForFork1_pop_#res_22|) (= (select (select |v_#memory_int_50| v_t2Thread1of1ForFork1_pop_~stack.base_15) (bvadd (bvmul |v_t2Thread1of1ForFork1_pop_#t~ret40_24| (_ bv4 32)) v_t2Thread1of1ForFork1_pop_~stack.offset_15)) |v_t2Thread1of1ForFork1_pop_#res_22|)) InVars {t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_24|, #memory_int=|v_#memory_int_50|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} OutVars{t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_15, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_29|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_22|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_17|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_23|, #memory_int=|v_#memory_int_50|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_15} 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:34,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [522] [522] L988-3-->L983-6: Formula: (and (not (= |v_t2Thread1of1ForFork1_#t~ret48_42| (_ bv4294967294 32))) (= (store |v_#pthreadsMutex_162| |v_~#m~0.base_76| (store (select |v_#pthreadsMutex_162| |v_~#m~0.base_76|) |v_~#m~0.offset_76| (_ bv0 1))) |v_#pthreadsMutex_161|) (= (bvadd v_t2Thread1of1ForFork1_~i~1_57 (_ bv1 32)) v_t2Thread1of1ForFork1_~i~1_56)) InVars {#pthreadsMutex=|v_#pthreadsMutex_162|, ~#m~0.base=|v_~#m~0.base_76|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_42|, ~#m~0.offset=|v_~#m~0.offset_76|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_57} OutVars{#pthreadsMutex=|v_#pthreadsMutex_161|, ~#m~0.base=|v_~#m~0.base_76|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_41|, ~#m~0.offset=|v_~#m~0.offset_76|, t2Thread1of1ForFork1_#t~post46=|v_t2Thread1of1ForFork1_#t~post46_17|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_56} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret48, t2Thread1of1ForFork1_#t~post46, t2Thread1of1ForFork1_~i~1] because there is no mapped edge [2019-11-28 17:57:34,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [449] [449] L983-6-->L985-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#m~0.base_12|))) (and (= (select .cse0 |v_~#m~0.offset_12|) (_ bv0 1)) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#m~0.base_12| (store .cse0 |v_~#m~0.offset_12| (_ bv1 1)))) (bvslt v_t2Thread1of1ForFork1_~i~1_12 (_ bv400 32)) (= |v_t2Thread1of1ForFork1_#t~nondet47_5| (_ bv0 32)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_5|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#m~0.base=|v_~#m~0.base_12|, ~#m~0.offset=|v_~#m~0.offset_12|, t2Thread1of1ForFork1_~i~1=v_t2Thread1of1ForFork1_~i~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~nondet47, #pthreadsMutex] because there is no mapped edge [2019-11-28 17:57:34,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [525] [525] L985-1-->L988-3: Formula: (and (not (= (_ bv0 8) v_~flag~0_49)) (= |v_t2Thread1of1ForFork1_get_top_#res_31| (_ bv0 32)) (= |v_t2Thread1of1ForFork1_pop_#in~stack.base_19| |v_~#arr~0.base_36|) (= v_t2Thread1of1ForFork1_pop_~stack.base_25 |v_t2Thread1of1ForFork1_pop_#in~stack.base_19|) (= v_~top~0_99 |v_t2Thread1of1ForFork1_get_top_#res_31|) (= |v_t2Thread1of1ForFork1_#t~ret48_49| |v_t2Thread1of1ForFork1_pop_#res_33|) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19| |v_~#arr~0.offset_33|) (= |v_t2Thread1of1ForFork1_pop_#res_33| (_ bv4294967294 32)) (= |v_t2Thread1of1ForFork1_pop_#in~stack.offset_19| v_t2Thread1of1ForFork1_pop_~stack.offset_25)) InVars {~#arr~0.offset=|v_~#arr~0.offset_33|, ~flag~0=v_~flag~0_49, ~top~0=v_~top~0_99, ~#arr~0.base=|v_~#arr~0.base_36|} OutVars{t2Thread1of1ForFork1_#t~nondet47=|v_t2Thread1of1ForFork1_#t~nondet47_47|, t2Thread1of1ForFork1_pop_~stack.offset=v_t2Thread1of1ForFork1_pop_~stack.offset_25, ~#arr~0.offset=|v_~#arr~0.offset_33|, t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_49|, t2Thread1of1ForFork1_pop_#res=|v_t2Thread1of1ForFork1_pop_#res_33|, ~flag~0=v_~flag~0_49, t2Thread1of1ForFork1_pop_#in~stack.offset=|v_t2Thread1of1ForFork1_pop_#in~stack.offset_19|, ~top~0=v_~top~0_99, t2Thread1of1ForFork1_pop_#t~ret37=|v_t2Thread1of1ForFork1_pop_#t~ret37_39|, t2Thread1of1ForFork1_get_top_#res=|v_t2Thread1of1ForFork1_get_top_#res_31|, t2Thread1of1ForFork1_pop_#t~mem41=|v_t2Thread1of1ForFork1_pop_#t~mem41_28|, t2Thread1of1ForFork1_pop_#t~ret40=|v_t2Thread1of1ForFork1_pop_#t~ret40_38|, t2Thread1of1ForFork1_pop_#t~nondet38=|v_t2Thread1of1ForFork1_pop_#t~nondet38_14|, t2Thread1of1ForFork1_pop_#in~stack.base=|v_t2Thread1of1ForFork1_pop_#in~stack.base_19|, t2Thread1of1ForFork1_pop_~stack.base=v_t2Thread1of1ForFork1_pop_~stack.base_25, ~#arr~0.base=|v_~#arr~0.base_36|} 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:34,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [471] [471] L988-3-->t2Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (= |v_t2Thread1of1ForFork1_#t~ret48_12| (_ bv4294967294 32)) InVars {t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_12|} OutVars{t2Thread1of1ForFork1_#t~ret48=|v_t2Thread1of1ForFork1_#t~ret48_11|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~ret48] because there is no mapped edge [2019-11-28 17:57:34,270 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:57:34,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:57:34,272 INFO L168 Benchmark]: Toolchain (without parser) took 19876.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -307.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:34,272 INFO L168 Benchmark]: CDTParser took 0.29 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:34,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1104.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:34,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.94 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:34,274 INFO L168 Benchmark]: Boogie Preprocessor took 59.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:34,275 INFO L168 Benchmark]: RCFGBuilder took 648.28 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:34,276 INFO L168 Benchmark]: TraceAbstraction took 17900.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -234.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:57:34,276 INFO L168 Benchmark]: Witness Printer took 48.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:57:34,280 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.29 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 1104.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -120.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.94 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 59.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 648.28 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17900.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -234.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 48.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 132 ProgramPointsBefore, 39 ProgramPointsAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 5420 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 2850 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 6183 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 918]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L999] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={75:0}, flag=0, m={-118:0}, top=0] [L1000] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={75:0}, flag=0, m={-118:0}, top=0] [L926] 2 top-- VAL [arr={75:0}, flag=1, m={-118:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 126 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.6s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 383 SDtfs, 786 SDslu, 2259 SDs, 0 SdLazy, 1639 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1271occurred 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, 6 MinimizatonAttempts, 1542 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 11463 SizeOfPredicates, 31 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 2/6 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...