./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6a1879d2537c7330f7d666c3922597c85bb8028 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-12-07 12:13:42,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:13:42,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:13:42,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:13:42,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:13:42,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:13:42,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:13:42,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:13:42,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:13:42,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:13:42,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:13:42,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:13:42,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:13:42,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:13:42,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:13:42,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:13:42,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:13:42,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:13:42,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:13:42,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:13:42,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:13:42,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:13:42,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:13:42,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:13:42,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:13:42,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:13:42,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:13:42,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:13:42,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:13:42,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:13:42,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:13:42,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:13:42,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:13:42,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:13:42,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:13:42,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:13:42,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:13:42,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:13:42,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:13:42,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:13:42,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:13:42,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:13:42,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:13:42,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:13:42,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:13:42,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:13:42,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:13:42,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:13:42,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:13:42,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:13:42,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:13:42,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:13:42,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:13:42,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:13:42,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:13:42,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:13:42,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:13:42,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:13:42,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:13:42,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:13:42,607 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6a1879d2537c7330f7d666c3922597c85bb8028 [2019-12-07 12:13:42,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:13:42,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:13:42,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:13:42,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:13:42,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:13:42,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i [2019-12-07 12:13:42,763 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/data/88dbf4a01/3d97964ce34e4eb694222c703c2f3553/FLAGfd6914f49 [2019-12-07 12:13:43,219 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:13:43,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/sv-benchmarks/c/pthread-wmm/mix038_pso.opt.i [2019-12-07 12:13:43,233 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/data/88dbf4a01/3d97964ce34e4eb694222c703c2f3553/FLAGfd6914f49 [2019-12-07 12:13:43,243 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/data/88dbf4a01/3d97964ce34e4eb694222c703c2f3553 [2019-12-07 12:13:43,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:13:43,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:13:43,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:13:43,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:13:43,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:13:43,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43, skipping insertion in model container [2019-12-07 12:13:43,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:13:43,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:13:43,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:13:43,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:13:43,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:13:43,644 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:13:43,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43 WrapperNode [2019-12-07 12:13:43,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:13:43,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:13:43,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:13:43,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:13:43,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:13:43,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:13:43,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:13:43,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:13:43,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... [2019-12-07 12:13:43,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:13:43,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:13:43,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:13:43,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:13:43,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:13:43,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:13:43,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:13:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:13:43,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:13:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:13:43,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:13:43,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:13:43,746 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:13:44,077 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:13:44,077 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:13:44,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:13:44 BoogieIcfgContainer [2019-12-07 12:13:44,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:13:44,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:13:44,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:13:44,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:13:44,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:13:43" (1/3) ... [2019-12-07 12:13:44,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733b0065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:13:44, skipping insertion in model container [2019-12-07 12:13:44,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:13:43" (2/3) ... [2019-12-07 12:13:44,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733b0065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:13:44, skipping insertion in model container [2019-12-07 12:13:44,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:13:44" (3/3) ... [2019-12-07 12:13:44,084 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt.i [2019-12-07 12:13:44,091 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:13:44,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:13:44,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:13:44,097 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:13:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,139 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,139 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,140 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:13:44,159 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:13:44,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:13:44,177 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:13:44,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:13:44,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:13:44,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:13:44,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:13:44,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:13:44,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:13:44,189 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-07 12:13:44,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-07 12:13:44,245 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-07 12:13:44,245 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:13:44,256 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:13:44,267 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-07 12:13:44,291 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-07 12:13:44,291 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:13:44,294 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 12:13:44,304 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 12:13:44,305 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:13:46,733 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 12:13:46,831 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-07 12:13:46,832 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 12:13:46,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-07 12:13:47,414 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-07 12:13:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-07 12:13:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:13:47,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:47,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:47,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-07 12:13:47,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:47,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10913276] [2019-12-07 12:13:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:47,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10913276] [2019-12-07 12:13:47,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:47,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:13:47,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450755052] [2019-12-07 12:13:47,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:13:47,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:13:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:13:47,618 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-07 12:13:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:47,812 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-07 12:13:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:13:47,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:13:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:47,913 INFO L225 Difference]: With dead ends: 13322 [2019-12-07 12:13:47,914 INFO L226 Difference]: Without dead ends: 12542 [2019-12-07 12:13:47,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 12:13:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-07 12:13:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-07 12:13:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-07 12:13:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-07 12:13:48,395 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-07 12:13:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:48,396 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-07 12:13:48,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:13:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-07 12:13:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:13:48,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:48,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:48,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-07 12:13:48,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:48,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844575768] [2019-12-07 12:13:48,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:48,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844575768] [2019-12-07 12:13:48,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:48,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:13:48,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69970355] [2019-12-07 12:13:48,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:13:48,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:13:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:13:48,462 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 4 states. [2019-12-07 12:13:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:48,686 INFO L93 Difference]: Finished difference Result 19054 states and 69906 transitions. [2019-12-07 12:13:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:13:48,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:13:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:48,747 INFO L225 Difference]: With dead ends: 19054 [2019-12-07 12:13:48,747 INFO L226 Difference]: Without dead ends: 19022 [2019-12-07 12:13:48,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:13:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-12-07 12:13:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 17202. [2019-12-07 12:13:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17202 states. [2019-12-07 12:13:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17202 states to 17202 states and 63964 transitions. [2019-12-07 12:13:49,283 INFO L78 Accepts]: Start accepts. Automaton has 17202 states and 63964 transitions. Word has length 13 [2019-12-07 12:13:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:49,284 INFO L462 AbstractCegarLoop]: Abstraction has 17202 states and 63964 transitions. [2019-12-07 12:13:49,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:13:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 17202 states and 63964 transitions. [2019-12-07 12:13:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:13:49,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:49,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:49,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-07 12:13:49,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:49,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329396476] [2019-12-07 12:13:49,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:49,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329396476] [2019-12-07 12:13:49,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:49,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:13:49,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327483721] [2019-12-07 12:13:49,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:13:49,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:49,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:13:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:13:49,359 INFO L87 Difference]: Start difference. First operand 17202 states and 63964 transitions. Second operand 4 states. [2019-12-07 12:13:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:49,521 INFO L93 Difference]: Finished difference Result 21830 states and 80562 transitions. [2019-12-07 12:13:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:13:49,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:13:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:49,565 INFO L225 Difference]: With dead ends: 21830 [2019-12-07 12:13:49,565 INFO L226 Difference]: Without dead ends: 21804 [2019-12-07 12:13:49,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:13:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21804 states. [2019-12-07 12:13:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21804 to 18792. [2019-12-07 12:13:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-12-07 12:13:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 69925 transitions. [2019-12-07 12:13:50,077 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 69925 transitions. Word has length 16 [2019-12-07 12:13:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:50,077 INFO L462 AbstractCegarLoop]: Abstraction has 18792 states and 69925 transitions. [2019-12-07 12:13:50,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:13:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 69925 transitions. [2019-12-07 12:13:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:13:50,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:50,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:50,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:50,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1486252895, now seen corresponding path program 1 times [2019-12-07 12:13:50,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:50,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648280526] [2019-12-07 12:13:50,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:50,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648280526] [2019-12-07 12:13:50,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:50,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:13:50,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392132209] [2019-12-07 12:13:50,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:13:50,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:13:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:13:50,132 INFO L87 Difference]: Start difference. First operand 18792 states and 69925 transitions. Second operand 3 states. [2019-12-07 12:13:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:50,167 INFO L93 Difference]: Finished difference Result 10902 states and 35418 transitions. [2019-12-07 12:13:50,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:13:50,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:13:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:50,181 INFO L225 Difference]: With dead ends: 10902 [2019-12-07 12:13:50,181 INFO L226 Difference]: Without dead ends: 10902 [2019-12-07 12:13:50,181 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-12-07 12:13:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-07 12:13:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-07 12:13:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-07 12:13:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 35418 transitions. [2019-12-07 12:13:50,378 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 35418 transitions. Word has length 18 [2019-12-07 12:13:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:50,378 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 35418 transitions. [2019-12-07 12:13:50,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:13:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 35418 transitions. [2019-12-07 12:13:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:13:50,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:50,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:50,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 586310958, now seen corresponding path program 1 times [2019-12-07 12:13:50,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:50,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062647574] [2019-12-07 12:13:50,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:50,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062647574] [2019-12-07 12:13:50,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:50,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:13:50,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177790802] [2019-12-07 12:13:50,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:13:50,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:13:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:13:50,421 INFO L87 Difference]: Start difference. First operand 10902 states and 35418 transitions. Second operand 3 states. [2019-12-07 12:13:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:50,466 INFO L93 Difference]: Finished difference Result 10348 states and 33108 transitions. [2019-12-07 12:13:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:13:50,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 12:13:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:50,484 INFO L225 Difference]: With dead ends: 10348 [2019-12-07 12:13:50,484 INFO L226 Difference]: Without dead ends: 10348 [2019-12-07 12:13:50,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 12:13:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2019-12-07 12:13:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 10124. [2019-12-07 12:13:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10124 states. [2019-12-07 12:13:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 32418 transitions. [2019-12-07 12:13:50,657 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 32418 transitions. Word has length 19 [2019-12-07 12:13:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:50,658 INFO L462 AbstractCegarLoop]: Abstraction has 10124 states and 32418 transitions. [2019-12-07 12:13:50,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:13:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 32418 transitions. [2019-12-07 12:13:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:13:50,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:50,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:50,660 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:50,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2061945651, now seen corresponding path program 1 times [2019-12-07 12:13:50,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:50,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348890630] [2019-12-07 12:13:50,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:50,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348890630] [2019-12-07 12:13:50,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:50,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:13:50,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605794189] [2019-12-07 12:13:50,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:13:50,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:50,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:13:50,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:13:50,718 INFO L87 Difference]: Start difference. First operand 10124 states and 32418 transitions. Second operand 4 states. [2019-12-07 12:13:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:50,776 INFO L93 Difference]: Finished difference Result 15437 states and 49588 transitions. [2019-12-07 12:13:50,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:13:50,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 12:13:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:50,799 INFO L225 Difference]: With dead ends: 15437 [2019-12-07 12:13:50,799 INFO L226 Difference]: Without dead ends: 14837 [2019-12-07 12:13:50,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-12-07 12:13:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14837 states. [2019-12-07 12:13:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14837 to 14778. [2019-12-07 12:13:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14778 states. [2019-12-07 12:13:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 47403 transitions. [2019-12-07 12:13:51,158 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 47403 transitions. Word has length 19 [2019-12-07 12:13:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:51,158 INFO L462 AbstractCegarLoop]: Abstraction has 14778 states and 47403 transitions. [2019-12-07 12:13:51,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:13:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 47403 transitions. [2019-12-07 12:13:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:13:51,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:51,163 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-12-07 12:13:51,164 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 65526288, now seen corresponding path program 1 times [2019-12-07 12:13:51,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:51,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410028489] [2019-12-07 12:13:51,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:51,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410028489] [2019-12-07 12:13:51,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:51,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:13:51,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111239733] [2019-12-07 12:13:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:13:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:13:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:13:51,193 INFO L87 Difference]: Start difference. First operand 14778 states and 47403 transitions. Second operand 4 states. [2019-12-07 12:13:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:51,213 INFO L93 Difference]: Finished difference Result 2691 states and 6861 transitions. [2019-12-07 12:13:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:13:51,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:13:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:51,216 INFO L225 Difference]: With dead ends: 2691 [2019-12-07 12:13:51,216 INFO L226 Difference]: Without dead ends: 2691 [2019-12-07 12:13:51,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 12:13:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2019-12-07 12:13:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2691. [2019-12-07 12:13:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-12-07 12:13:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 6861 transitions. [2019-12-07 12:13:51,243 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 6861 transitions. Word has length 21 [2019-12-07 12:13:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:51,243 INFO L462 AbstractCegarLoop]: Abstraction has 2691 states and 6861 transitions. [2019-12-07 12:13:51,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:13:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 6861 transitions. [2019-12-07 12:13:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:13:51,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:51,246 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:51,246 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-07 12:13:51,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:51,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532607144] [2019-12-07 12:13:51,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:51,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532607144] [2019-12-07 12:13:51,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:51,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:13:51,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942521150] [2019-12-07 12:13:51,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:13:51,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:13:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:13:51,299 INFO L87 Difference]: Start difference. First operand 2691 states and 6861 transitions. Second operand 6 states. [2019-12-07 12:13:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:51,598 INFO L93 Difference]: Finished difference Result 6887 states and 17570 transitions. [2019-12-07 12:13:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:13:51,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 12:13:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:51,604 INFO L225 Difference]: With dead ends: 6887 [2019-12-07 12:13:51,604 INFO L226 Difference]: Without dead ends: 6883 [2019-12-07 12:13:51,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:13:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2019-12-07 12:13:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 3550. [2019-12-07 12:13:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-12-07 12:13:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 9245 transitions. [2019-12-07 12:13:51,662 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 9245 transitions. Word has length 29 [2019-12-07 12:13:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:51,663 INFO L462 AbstractCegarLoop]: Abstraction has 3550 states and 9245 transitions. [2019-12-07 12:13:51,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:13:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 9245 transitions. [2019-12-07 12:13:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:13:51,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:51,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:51,666 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1490700114, now seen corresponding path program 1 times [2019-12-07 12:13:51,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:51,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142049254] [2019-12-07 12:13:51,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:51,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142049254] [2019-12-07 12:13:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:13:51,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745443549] [2019-12-07 12:13:51,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:13:51,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:13:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:13:51,734 INFO L87 Difference]: Start difference. First operand 3550 states and 9245 transitions. Second operand 6 states. [2019-12-07 12:13:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:52,011 INFO L93 Difference]: Finished difference Result 6614 states and 16778 transitions. [2019-12-07 12:13:52,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:13:52,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 12:13:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:52,016 INFO L225 Difference]: With dead ends: 6614 [2019-12-07 12:13:52,016 INFO L226 Difference]: Without dead ends: 6612 [2019-12-07 12:13:52,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:13:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2019-12-07 12:13:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 3219. [2019-12-07 12:13:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3219 states. [2019-12-07 12:13:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 8378 transitions. [2019-12-07 12:13:52,062 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 8378 transitions. Word has length 30 [2019-12-07 12:13:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 3219 states and 8378 transitions. [2019-12-07 12:13:52,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:13:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 8378 transitions. [2019-12-07 12:13:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:13:52,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:52,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:52,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 60099491, now seen corresponding path program 1 times [2019-12-07 12:13:52,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:52,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153706790] [2019-12-07 12:13:52,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:52,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153706790] [2019-12-07 12:13:52,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:52,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:13:52,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478941447] [2019-12-07 12:13:52,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:13:52,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:13:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:13:52,100 INFO L87 Difference]: Start difference. First operand 3219 states and 8378 transitions. Second operand 5 states. [2019-12-07 12:13:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:52,121 INFO L93 Difference]: Finished difference Result 1932 states and 5202 transitions. [2019-12-07 12:13:52,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:13:52,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 12:13:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:52,123 INFO L225 Difference]: With dead ends: 1932 [2019-12-07 12:13:52,123 INFO L226 Difference]: Without dead ends: 1880 [2019-12-07 12:13:52,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:13:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2019-12-07 12:13:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1142. [2019-12-07 12:13:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-07 12:13:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 3162 transitions. [2019-12-07 12:13:52,137 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 3162 transitions. Word has length 30 [2019-12-07 12:13:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:52,137 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 3162 transitions. [2019-12-07 12:13:52,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:13:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 3162 transitions. [2019-12-07 12:13:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:13:52,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:52,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:52,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:52,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 748255129, now seen corresponding path program 1 times [2019-12-07 12:13:52,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:52,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986216076] [2019-12-07 12:13:52,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:52,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986216076] [2019-12-07 12:13:52,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:52,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:13:52,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594287489] [2019-12-07 12:13:52,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:13:52,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:13:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:13:52,304 INFO L87 Difference]: Start difference. First operand 1142 states and 3162 transitions. Second operand 10 states. [2019-12-07 12:13:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:55,740 INFO L93 Difference]: Finished difference Result 5613 states and 14489 transitions. [2019-12-07 12:13:55,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 12:13:55,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-12-07 12:13:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:55,745 INFO L225 Difference]: With dead ends: 5613 [2019-12-07 12:13:55,745 INFO L226 Difference]: Without dead ends: 5095 [2019-12-07 12:13:55,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=551, Invalid=2311, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 12:13:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2019-12-07 12:13:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 1844. [2019-12-07 12:13:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-07 12:13:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5253 transitions. [2019-12-07 12:13:55,777 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5253 transitions. Word has length 45 [2019-12-07 12:13:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:55,778 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5253 transitions. [2019-12-07 12:13:55,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:13:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5253 transitions. [2019-12-07 12:13:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:13:55,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:55,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:55,780 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 873956953, now seen corresponding path program 2 times [2019-12-07 12:13:55,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:55,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701403465] [2019-12-07 12:13:55,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:55,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701403465] [2019-12-07 12:13:55,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:55,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:13:55,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087439203] [2019-12-07 12:13:55,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:13:55,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:13:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:13:55,837 INFO L87 Difference]: Start difference. First operand 1844 states and 5253 transitions. Second operand 4 states. [2019-12-07 12:13:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:55,857 INFO L93 Difference]: Finished difference Result 2783 states and 7496 transitions. [2019-12-07 12:13:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:13:55,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 12:13:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:55,859 INFO L225 Difference]: With dead ends: 2783 [2019-12-07 12:13:55,859 INFO L226 Difference]: Without dead ends: 979 [2019-12-07 12:13:55,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 12:13:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-12-07 12:13:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2019-12-07 12:13:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-12-07 12:13:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2318 transitions. [2019-12-07 12:13:55,871 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2318 transitions. Word has length 45 [2019-12-07 12:13:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:55,871 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 2318 transitions. [2019-12-07 12:13:55,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:13:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2318 transitions. [2019-12-07 12:13:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:13:55,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:55,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:55,873 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1228347383, now seen corresponding path program 3 times [2019-12-07 12:13:55,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:55,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808121722] [2019-12-07 12:13:55,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:13:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:13:55,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808121722] [2019-12-07 12:13:55,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:13:55,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:13:55,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535750028] [2019-12-07 12:13:55,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:13:55,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:13:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:13:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:13:55,934 INFO L87 Difference]: Start difference. First operand 979 states and 2318 transitions. Second operand 6 states. [2019-12-07 12:13:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:13:56,041 INFO L93 Difference]: Finished difference Result 2429 states and 5521 transitions. [2019-12-07 12:13:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:13:56,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 12:13:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:13:56,043 INFO L225 Difference]: With dead ends: 2429 [2019-12-07 12:13:56,043 INFO L226 Difference]: Without dead ends: 1637 [2019-12-07 12:13:56,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:13:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-12-07 12:13:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 963. [2019-12-07 12:13:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 12:13:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2228 transitions. [2019-12-07 12:13:56,053 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2228 transitions. Word has length 45 [2019-12-07 12:13:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:13:56,053 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2228 transitions. [2019-12-07 12:13:56,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:13:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2228 transitions. [2019-12-07 12:13:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:13:56,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:13:56,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:13:56,055 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:13:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:13:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 4 times [2019-12-07 12:13:56,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:13:56,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274552018] [2019-12-07 12:13:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:13:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:13:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:13:56,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:13:56,111 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:13:56,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32|) |v_ULTIMATE.start_main_~#t1010~0.offset_22| 0))) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1010~0.base_32| 4)) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~y$r_buff0_thd1~0_39 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_32|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32|) 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_133) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_22|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_32|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_26|, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_15|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:13:56,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-12-07 12:13:56,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:13:56,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff0_thd3~0_In-598227223 ~y$r_buff1_thd3~0_Out-598227223) (= ~y$r_buff0_thd2~0_In-598227223 ~y$r_buff1_thd2~0_Out-598227223) (= 1 ~y$r_buff0_thd3~0_Out-598227223) (= 1 ~z~0_Out-598227223) (= ~y$r_buff0_thd1~0_In-598227223 ~y$r_buff1_thd1~0_Out-598227223) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223)) (= ~__unbuffered_p2_EAX~0_Out-598227223 ~z~0_Out-598227223) (= ~a~0_In-598227223 ~__unbuffered_p2_EBX~0_Out-598227223) (= ~y$r_buff1_thd0~0_Out-598227223 ~y$r_buff0_thd0~0_In-598227223)) InVars {~a~0=~a~0_In-598227223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-598227223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-598227223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-598227223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-598227223, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-598227223, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-598227223, ~a~0=~a~0_In-598227223, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-598227223, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-598227223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-598227223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-598227223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-598227223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-598227223, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-598227223, ~z~0=~z~0_Out-598227223, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-598227223} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:13:56,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:13:56,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In799190554 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out799190554| |P1Thread1of1ForFork1_#t~ite8_Out799190554|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In799190554 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In799190554 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In799190554 256) 0)) (= (mod ~y$w_buff0_used~0_In799190554 256) 0))) .cse1 (= ~y$w_buff0~0_In799190554 |P1Thread1of1ForFork1_#t~ite8_Out799190554|)) (and (= ~y$w_buff0~0_In799190554 |P1Thread1of1ForFork1_#t~ite9_Out799190554|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In799190554| |P1Thread1of1ForFork1_#t~ite8_Out799190554|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In799190554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799190554, ~y$w_buff0~0=~y$w_buff0~0_In799190554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In799190554|, ~weak$$choice2~0=~weak$$choice2~0_In799190554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799190554} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In799190554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799190554, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out799190554|, ~y$w_buff0~0=~y$w_buff0~0_In799190554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out799190554|, ~weak$$choice2~0=~weak$$choice2~0_In799190554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799190554} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:13:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-383496609 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-383496609| ~y$w_buff1~0_In-383496609) (= |P1Thread1of1ForFork1_#t~ite11_In-383496609| |P1Thread1of1ForFork1_#t~ite11_Out-383496609|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out-383496609| |P1Thread1of1ForFork1_#t~ite12_Out-383496609|) (= |P1Thread1of1ForFork1_#t~ite11_Out-383496609| ~y$w_buff1~0_In-383496609) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-383496609 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-383496609 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-383496609 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-383496609 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383496609, ~y$w_buff1~0=~y$w_buff1~0_In-383496609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383496609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383496609, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-383496609|, ~weak$$choice2~0=~weak$$choice2~0_In-383496609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383496609} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383496609, ~y$w_buff1~0=~y$w_buff1~0_In-383496609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383496609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383496609, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-383496609|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-383496609|, ~weak$$choice2~0=~weak$$choice2~0_In-383496609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383496609} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:13:56,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2016912808 256)))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In2016912808 |P1Thread1of1ForFork1_#t~ite15_Out2016912808|) (= |P1Thread1of1ForFork1_#t~ite14_In2016912808| |P1Thread1of1ForFork1_#t~ite14_Out2016912808|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out2016912808| |P1Thread1of1ForFork1_#t~ite15_Out2016912808|) (= ~y$w_buff0_used~0_In2016912808 |P1Thread1of1ForFork1_#t~ite14_Out2016912808|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2016912808 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2016912808 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2016912808 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In2016912808 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2016912808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2016912808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016912808, ~weak$$choice2~0=~weak$$choice2~0_In2016912808, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2016912808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2016912808} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2016912808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2016912808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016912808, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2016912808|, ~weak$$choice2~0=~weak$$choice2~0_In2016912808, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2016912808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2016912808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:13:56,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:13:56,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:13:56,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1637898096 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1637898096 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1637898096| ~y$w_buff0_used~0_In1637898096)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1637898096| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1637898096, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1637898096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1637898096, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1637898096, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1637898096|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:13:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1705681559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1705681559 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1705681559 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1705681559 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1705681559 |P2Thread1of1ForFork2_#t~ite29_Out-1705681559|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1705681559|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705681559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705681559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705681559} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705681559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705681559, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1705681559|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705681559} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:13:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2112925162 256))) (.cse0 (= ~y$r_buff0_thd3~0_In-2112925162 ~y$r_buff0_thd3~0_Out-2112925162)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-2112925162) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2112925162} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2112925162|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2112925162} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:13:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In131135957 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In131135957 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In131135957 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In131135957 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out131135957| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite31_Out131135957| ~y$r_buff1_thd3~0_In131135957)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out131135957|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:13:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:13:56,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:13:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In954182915 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In954182915 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out954182915| ~y~0_In954182915)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out954182915| ~y$w_buff1~0_In954182915)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In954182915, ~y~0=~y~0_In954182915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In954182915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In954182915} OutVars{~y$w_buff1~0=~y$w_buff1~0_In954182915, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out954182915|, ~y~0=~y~0_In954182915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In954182915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In954182915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:13:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:13:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In35245333 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In35245333 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out35245333| ~y$w_buff0_used~0_In35245333) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out35245333| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35245333} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35245333, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out35245333|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:13:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1474685044 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1474685044 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1474685044 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1474685044 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1474685044| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1474685044| ~y$w_buff1_used~0_In-1474685044) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474685044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1474685044, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1474685044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474685044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474685044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1474685044, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1474685044|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1474685044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474685044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:13:56,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In424685905 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In424685905 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out424685905| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out424685905| ~y$r_buff0_thd0~0_In424685905) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In424685905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424685905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In424685905, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out424685905|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424685905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:13:56,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-596423444 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-596423444 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-596423444 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-596423444 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-596423444| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out-596423444| ~y$r_buff1_thd0~0_In-596423444) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-596423444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-596423444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-596423444|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-596423444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-596423444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:13:56,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:13:56,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:13:56 BasicIcfg [2019-12-07 12:13:56,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:13:56,164 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:13:56,164 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:13:56,164 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:13:56,165 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:13:44" (3/4) ... [2019-12-07 12:13:56,166 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:13:56,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1010~0.base_32|) |v_ULTIMATE.start_main_~#t1010~0.offset_22| 0))) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1010~0.base_32| 4)) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~y$r_buff0_thd1~0_39 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1010~0.base_32|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32|) 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t1010~0.offset_22|) (= 0 v_~y$r_buff0_thd3~0_133) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1010~0.base_32| 1)) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, ULTIMATE.start_main_~#t1010~0.offset=|v_ULTIMATE.start_main_~#t1010~0.offset_22|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_~#t1010~0.base=|v_ULTIMATE.start_main_~#t1010~0.base_32|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_26|, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_15|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1010~0.offset, #NULL.offset, ULTIMATE.start_main_~#t1011~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1010~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1012~0.base, ~y~0, ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1011~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:13:56,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1011~0.base_11| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1011~0.base_11|) |v_ULTIMATE.start_main_~#t1011~0.offset_9| 1)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t1011~0.offset_9| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1011~0.base_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1011~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1011~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1011~0.offset=|v_ULTIMATE.start_main_~#t1011~0.offset_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1011~0.base=|v_ULTIMATE.start_main_~#t1011~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1011~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1011~0.base] because there is no mapped edge [2019-12-07 12:13:56,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1012~0.base_10|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1012~0.base_10|) 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1012~0.base_10|) |v_ULTIMATE.start_main_~#t1012~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1012~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1012~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t1012~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1012~0.offset=|v_ULTIMATE.start_main_~#t1012~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t1012~0.base=|v_ULTIMATE.start_main_~#t1012~0.base_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1012~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1012~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:13:56,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff0_thd3~0_In-598227223 ~y$r_buff1_thd3~0_Out-598227223) (= ~y$r_buff0_thd2~0_In-598227223 ~y$r_buff1_thd2~0_Out-598227223) (= 1 ~y$r_buff0_thd3~0_Out-598227223) (= 1 ~z~0_Out-598227223) (= ~y$r_buff0_thd1~0_In-598227223 ~y$r_buff1_thd1~0_Out-598227223) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223)) (= ~__unbuffered_p2_EAX~0_Out-598227223 ~z~0_Out-598227223) (= ~a~0_In-598227223 ~__unbuffered_p2_EBX~0_Out-598227223) (= ~y$r_buff1_thd0~0_Out-598227223 ~y$r_buff0_thd0~0_In-598227223)) InVars {~a~0=~a~0_In-598227223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-598227223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-598227223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-598227223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-598227223, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-598227223, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-598227223, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-598227223, ~a~0=~a~0_In-598227223, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-598227223, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-598227223, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-598227223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-598227223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-598227223, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-598227223, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-598227223, ~z~0=~z~0_Out-598227223, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-598227223} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:13:56,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:13:56,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In799190554 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out799190554| |P1Thread1of1ForFork1_#t~ite8_Out799190554|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In799190554 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In799190554 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In799190554 256) 0)) (= (mod ~y$w_buff0_used~0_In799190554 256) 0))) .cse1 (= ~y$w_buff0~0_In799190554 |P1Thread1of1ForFork1_#t~ite8_Out799190554|)) (and (= ~y$w_buff0~0_In799190554 |P1Thread1of1ForFork1_#t~ite9_Out799190554|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite8_In799190554| |P1Thread1of1ForFork1_#t~ite8_Out799190554|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In799190554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799190554, ~y$w_buff0~0=~y$w_buff0~0_In799190554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In799190554|, ~weak$$choice2~0=~weak$$choice2~0_In799190554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799190554} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In799190554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799190554, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out799190554|, ~y$w_buff0~0=~y$w_buff0~0_In799190554, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In799190554, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out799190554|, ~weak$$choice2~0=~weak$$choice2~0_In799190554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In799190554} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 12:13:56,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-383496609 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out-383496609| ~y$w_buff1~0_In-383496609) (= |P1Thread1of1ForFork1_#t~ite11_In-383496609| |P1Thread1of1ForFork1_#t~ite11_Out-383496609|) (not .cse0)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out-383496609| |P1Thread1of1ForFork1_#t~ite12_Out-383496609|) (= |P1Thread1of1ForFork1_#t~ite11_Out-383496609| ~y$w_buff1~0_In-383496609) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-383496609 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-383496609 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-383496609 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-383496609 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383496609, ~y$w_buff1~0=~y$w_buff1~0_In-383496609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383496609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383496609, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-383496609|, ~weak$$choice2~0=~weak$$choice2~0_In-383496609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383496609} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383496609, ~y$w_buff1~0=~y$w_buff1~0_In-383496609, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383496609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383496609, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-383496609|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-383496609|, ~weak$$choice2~0=~weak$$choice2~0_In-383496609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383496609} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 12:13:56,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2016912808 256)))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In2016912808 |P1Thread1of1ForFork1_#t~ite15_Out2016912808|) (= |P1Thread1of1ForFork1_#t~ite14_In2016912808| |P1Thread1of1ForFork1_#t~ite14_Out2016912808|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out2016912808| |P1Thread1of1ForFork1_#t~ite15_Out2016912808|) (= ~y$w_buff0_used~0_In2016912808 |P1Thread1of1ForFork1_#t~ite14_Out2016912808|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2016912808 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2016912808 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2016912808 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In2016912808 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2016912808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2016912808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016912808, ~weak$$choice2~0=~weak$$choice2~0_In2016912808, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2016912808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2016912808} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2016912808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2016912808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2016912808, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2016912808|, ~weak$$choice2~0=~weak$$choice2~0_In2016912808, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2016912808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2016912808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:13:56,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:13:56,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:13:56,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1637898096 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1637898096 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1637898096| ~y$w_buff0_used~0_In1637898096)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out1637898096| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1637898096, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1637898096} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1637898096, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1637898096, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1637898096|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:13:56,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1705681559 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1705681559 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1705681559 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1705681559 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1705681559 |P2Thread1of1ForFork2_#t~ite29_Out-1705681559|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1705681559|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705681559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705681559, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705681559} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1705681559, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1705681559, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1705681559, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1705681559|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1705681559} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 12:13:56,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2112925162 256))) (.cse0 (= ~y$r_buff0_thd3~0_In-2112925162 ~y$r_buff0_thd3~0_Out-2112925162)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2112925162 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-2112925162) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2112925162} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2112925162, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-2112925162|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2112925162} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:13:56,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In131135957 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In131135957 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In131135957 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In131135957 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out131135957| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite31_Out131135957| ~y$r_buff1_thd3~0_In131135957)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In131135957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In131135957, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out131135957|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In131135957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In131135957} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 12:13:56,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:13:56,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:13:56,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In954182915 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In954182915 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out954182915| ~y~0_In954182915)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out954182915| ~y$w_buff1~0_In954182915)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In954182915, ~y~0=~y~0_In954182915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In954182915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In954182915} OutVars{~y$w_buff1~0=~y$w_buff1~0_In954182915, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out954182915|, ~y~0=~y~0_In954182915, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In954182915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In954182915} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 12:13:56,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 12:13:56,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In35245333 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In35245333 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out35245333| ~y$w_buff0_used~0_In35245333) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out35245333| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35245333} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In35245333, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In35245333, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out35245333|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 12:13:56,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1474685044 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1474685044 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1474685044 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1474685044 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1474685044| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1474685044| ~y$w_buff1_used~0_In-1474685044) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474685044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1474685044, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1474685044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474685044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474685044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1474685044, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1474685044|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1474685044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474685044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 12:13:56,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In424685905 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In424685905 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out424685905| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out424685905| ~y$r_buff0_thd0~0_In424685905) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In424685905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424685905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In424685905, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out424685905|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In424685905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 12:13:56,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-596423444 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-596423444 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-596423444 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-596423444 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-596423444| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out-596423444| ~y$r_buff1_thd0~0_In-596423444) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-596423444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-596423444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-596423444|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-596423444, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-596423444, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-596423444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-596423444} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:13:56,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:13:56,220 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2ffd1444-8fb2-4e01-8c18-b7428340cf15/bin/uautomizer/witness.graphml [2019-12-07 12:13:56,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:13:56,221 INFO L168 Benchmark]: Toolchain (without parser) took 12975.04 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 731.4 MB). Free memory was 942.4 MB in the beginning and 852.2 MB in the end (delta: 90.2 MB). Peak memory consumption was 821.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,221 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:13:56,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.74 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,222 INFO L168 Benchmark]: Boogie Preprocessor took 23.27 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-12-07 12:13:56,222 INFO L168 Benchmark]: RCFGBuilder took 374.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,223 INFO L168 Benchmark]: TraceAbstraction took 12085.28 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 649.1 MB). Free memory was 993.8 MB in the beginning and 873.0 MB in the end (delta: 120.8 MB). Peak memory consumption was 769.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,223 INFO L168 Benchmark]: Witness Printer took 55.57 ms. Allocated memory is still 1.8 GB. Free memory was 873.0 MB in the beginning and 852.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:13:56,224 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -107.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.74 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.27 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 374.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 993.8 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12085.28 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 649.1 MB). Free memory was 993.8 MB in the beginning and 873.0 MB in the end (delta: 120.8 MB). Peak memory consumption was 769.9 MB. Max. memory is 11.5 GB. * Witness Printer took 55.57 ms. Allocated memory is still 1.8 GB. Free memory was 873.0 MB in the beginning and 852.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1010, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1011, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1012, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1704 SDtfs, 2129 SDslu, 3592 SDs, 0 SdLazy, 3609 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18792occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 16504 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 57028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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...