./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_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_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53fb212e5d3c8b8515adeaa8c75624fee39c7d13 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:57:29,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:57:29,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:57:29,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:57:29,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:57:29,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:57:29,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:57:29,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:57:29,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:57:29,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:57:29,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:57:29,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:57:29,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:57:29,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:57:29,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:57:29,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:57:29,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:57:29,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:57:29,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:57:29,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:57:29,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:57:29,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:57:29,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:57:29,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:57:29,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:57:29,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:57:29,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:57:29,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:57:29,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:57:29,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:57:29,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:57:29,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:57:29,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:57:29,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:57:29,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:57:29,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:57:29,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:57:29,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:57:29,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:57:29,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:57:29,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:57:29,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:57:29,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:57:29,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:57:29,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:57:29,658 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:57:29,658 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:57:29,659 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:57:29,659 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:57:29,659 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:57:29,659 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:57:29,659 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:57:29,660 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:57:29,660 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:57:29,660 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:57:29,660 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:57:29,660 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:57:29,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:57:29,661 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:57:29,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:57:29,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:57:29,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:57:29,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:57:29,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:57:29,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:57:29,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:57:29,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:57:29,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:57:29,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:57:29,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:57:29,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:57:29,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:57:29,664 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:57:29,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:57:29,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:57:29,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:57:29,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:57:29,665 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan 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 -> Taipan 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 -> 53fb212e5d3c8b8515adeaa8c75624fee39c7d13 [2019-12-07 20:57:29,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:57:29,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:57:29,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:57:29,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:57:29,781 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:57:29,782 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i [2019-12-07 20:57:29,818 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/data/14a103e5c/71cf048d00fc4e86a4cbeaae0aae111f/FLAG17ffa1558 [2019-12-07 20:57:30,201 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:57:30,201 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/sv-benchmarks/c/pthread-wmm/mix026_pso.opt.i [2019-12-07 20:57:30,212 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/data/14a103e5c/71cf048d00fc4e86a4cbeaae0aae111f/FLAG17ffa1558 [2019-12-07 20:57:30,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/data/14a103e5c/71cf048d00fc4e86a4cbeaae0aae111f [2019-12-07 20:57:30,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:57:30,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:57:30,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:57:30,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:57:30,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:57:30,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30, skipping insertion in model container [2019-12-07 20:57:30,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:57:30,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:57:30,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:57:30,575 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:57:30,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:57:30,689 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:57:30,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30 WrapperNode [2019-12-07 20:57:30,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:57:30,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:57:30,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:57:30,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:57:30,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:57:30,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:57:30,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:57:30,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:57:30,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... [2019-12-07 20:57:30,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:57:30,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:57:30,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:57:30,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:57:30,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/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 20:57:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:57:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:57:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:57:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:57:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 20:57:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 20:57:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:57:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:57:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:57:30,796 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:57:31,145 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:57:31,145 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:57:31,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:57:31 BoogieIcfgContainer [2019-12-07 20:57:31,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:57:31,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:57:31,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:57:31,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:57:31,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:57:30" (1/3) ... [2019-12-07 20:57:31,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a025794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:57:31, skipping insertion in model container [2019-12-07 20:57:31,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:57:30" (2/3) ... [2019-12-07 20:57:31,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a025794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:57:31, skipping insertion in model container [2019-12-07 20:57:31,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:57:31" (3/3) ... [2019-12-07 20:57:31,151 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-07 20:57:31,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:57:31,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:57:31,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:57:31,162 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:57:31,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,188 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,204 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:57:31,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 20:57:31,232 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:57:31,232 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:57:31,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:57:31,232 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:57:31,232 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:57:31,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:57:31,232 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:57:31,232 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:57:31,244 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-07 20:57:31,245 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 20:57:31,302 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 20:57:31,302 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:57:31,312 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 20:57:31,327 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-07 20:57:31,358 INFO L134 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-07 20:57:31,358 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:57:31,363 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 719 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 20:57:31,378 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 20:57:31,378 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:57:34,625 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 20:57:34,790 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 20:57:34,889 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-07 20:57:34,889 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 20:57:34,891 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-07 20:57:59,334 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-07 20:57:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-07 20:57:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:57:59,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:57:59,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:57:59,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:57:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:57:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-07 20:57:59,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:57:59,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580457278] [2019-12-07 20:57:59,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:57:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:57:59,497 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 20:57:59,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580457278] [2019-12-07 20:57:59,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:57:59,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:57:59,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114510338] [2019-12-07 20:57:59,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:57:59,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:57:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:57:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:57:59,512 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-07 20:58:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:00,653 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-07 20:58:00,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:58:00,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:58:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:01,275 INFO L225 Difference]: With dead ends: 152486 [2019-12-07 20:58:01,276 INFO L226 Difference]: Without dead ends: 143750 [2019-12-07 20:58:01,276 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 20:58:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-07 20:58:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-07 20:58:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-07 20:58:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-07 20:58:10,504 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-07 20:58:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-07 20:58:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:58:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-07 20:58:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:58:10,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:10,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:58:10,513 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:58:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-07 20:58:10,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:58:10,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716318760] [2019-12-07 20:58:10,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:58:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:10,576 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 20:58:10,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716318760] [2019-12-07 20:58:10,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:10,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:58:10,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041627051] [2019-12-07 20:58:10,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:58:10,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:58:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:58:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:58:10,578 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-07 20:58:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:11,859 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-07 20:58:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:58:11,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 20:58:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:15,043 INFO L225 Difference]: With dead ends: 226574 [2019-12-07 20:58:15,043 INFO L226 Difference]: Without dead ends: 226406 [2019-12-07 20:58:15,044 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 20:58:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-07 20:58:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-07 20:58:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-07 20:58:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-07 20:58:24,806 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-07 20:58:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:24,806 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-07 20:58:24,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:58:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-07 20:58:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:58:24,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:24,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:58:24,811 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:58:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-07 20:58:24,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:58:24,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777016254] [2019-12-07 20:58:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:58:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:24,876 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 20:58:24,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777016254] [2019-12-07 20:58:24,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:24,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:58:24,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000396696] [2019-12-07 20:58:24,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:58:24,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:58:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:58:24,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:58:24,878 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 4 states. [2019-12-07 20:58:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:26,491 INFO L93 Difference]: Finished difference Result 290690 states and 1317990 transitions. [2019-12-07 20:58:26,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:58:26,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 20:58:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:27,404 INFO L225 Difference]: With dead ends: 290690 [2019-12-07 20:58:27,404 INFO L226 Difference]: Without dead ends: 290498 [2019-12-07 20:58:27,404 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 20:58:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290498 states. [2019-12-07 20:58:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290498 to 247334. [2019-12-07 20:58:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247334 states. [2019-12-07 20:58:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247334 states to 247334 states and 1137054 transitions. [2019-12-07 20:58:41,918 INFO L78 Accepts]: Start accepts. Automaton has 247334 states and 1137054 transitions. Word has length 15 [2019-12-07 20:58:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:58:41,918 INFO L462 AbstractCegarLoop]: Abstraction has 247334 states and 1137054 transitions. [2019-12-07 20:58:41,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:58:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 247334 states and 1137054 transitions. [2019-12-07 20:58:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:58:41,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:58:41,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:58:41,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:58:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:58:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-07 20:58:41,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:58:41,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763505938] [2019-12-07 20:58:41,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:58:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:58:41,971 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 20:58:41,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763505938] [2019-12-07 20:58:41,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:58:41,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:58:41,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574106370] [2019-12-07 20:58:41,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:58:41,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:58:41,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:58:41,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:58:41,973 INFO L87 Difference]: Start difference. First operand 247334 states and 1137054 transitions. Second operand 5 states. [2019-12-07 20:58:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:58:44,338 INFO L93 Difference]: Finished difference Result 335030 states and 1515532 transitions. [2019-12-07 20:58:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:58:44,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 20:58:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:58:45,319 INFO L225 Difference]: With dead ends: 335030 [2019-12-07 20:58:45,319 INFO L226 Difference]: Without dead ends: 334758 [2019-12-07 20:58:45,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:58:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334758 states. [2019-12-07 20:58:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334758 to 261640. [2019-12-07 20:58:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261640 states. [2019-12-07 20:59:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261640 states to 261640 states and 1201383 transitions. [2019-12-07 20:59:00,483 INFO L78 Accepts]: Start accepts. Automaton has 261640 states and 1201383 transitions. Word has length 16 [2019-12-07 20:59:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:00,484 INFO L462 AbstractCegarLoop]: Abstraction has 261640 states and 1201383 transitions. [2019-12-07 20:59:00,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:59:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 261640 states and 1201383 transitions. [2019-12-07 20:59:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:59:00,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:00,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:00,512 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash -590847212, now seen corresponding path program 1 times [2019-12-07 20:59:00,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:00,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153211636] [2019-12-07 20:59:00,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:00,577 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 20:59:00,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153211636] [2019-12-07 20:59:00,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:00,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:59:00,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669971560] [2019-12-07 20:59:00,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:59:00,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:59:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:59:00,579 INFO L87 Difference]: Start difference. First operand 261640 states and 1201383 transitions. Second operand 3 states. [2019-12-07 20:59:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:02,298 INFO L93 Difference]: Finished difference Result 246888 states and 1122565 transitions. [2019-12-07 20:59:02,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:59:02,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:59:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:03,015 INFO L225 Difference]: With dead ends: 246888 [2019-12-07 20:59:03,015 INFO L226 Difference]: Without dead ends: 246888 [2019-12-07 20:59:03,016 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 20:59:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246888 states. [2019-12-07 20:59:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246888 to 243128. [2019-12-07 20:59:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243128 states. [2019-12-07 20:59:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243128 states to 243128 states and 1106381 transitions. [2019-12-07 20:59:17,163 INFO L78 Accepts]: Start accepts. Automaton has 243128 states and 1106381 transitions. Word has length 20 [2019-12-07 20:59:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:17,163 INFO L462 AbstractCegarLoop]: Abstraction has 243128 states and 1106381 transitions. [2019-12-07 20:59:17,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:59:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 243128 states and 1106381 transitions. [2019-12-07 20:59:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:59:17,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:17,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:59:17,180 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597908, now seen corresponding path program 1 times [2019-12-07 20:59:17,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:17,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211005192] [2019-12-07 20:59:17,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:17,215 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 20:59:17,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211005192] [2019-12-07 20:59:17,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:17,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:59:17,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458977487] [2019-12-07 20:59:17,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:59:17,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:59:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:59:17,217 INFO L87 Difference]: Start difference. First operand 243128 states and 1106381 transitions. Second operand 3 states. [2019-12-07 20:59:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:17,861 INFO L93 Difference]: Finished difference Result 148148 states and 606205 transitions. [2019-12-07 20:59:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:59:17,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 20:59:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:18,237 INFO L225 Difference]: With dead ends: 148148 [2019-12-07 20:59:18,237 INFO L226 Difference]: Without dead ends: 148148 [2019-12-07 20:59:18,238 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 20:59:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148148 states. [2019-12-07 20:59:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148148 to 148148. [2019-12-07 20:59:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148148 states. [2019-12-07 20:59:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148148 states to 148148 states and 606205 transitions. [2019-12-07 20:59:23,828 INFO L78 Accepts]: Start accepts. Automaton has 148148 states and 606205 transitions. Word has length 20 [2019-12-07 20:59:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:23,829 INFO L462 AbstractCegarLoop]: Abstraction has 148148 states and 606205 transitions. [2019-12-07 20:59:23,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:59:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 148148 states and 606205 transitions. [2019-12-07 20:59:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:59:23,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:23,841 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 20:59:23,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1169391876, now seen corresponding path program 1 times [2019-12-07 20:59:23,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:23,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536308466] [2019-12-07 20:59:23,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:23,891 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 20:59:23,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536308466] [2019-12-07 20:59:23,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:23,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:59:23,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742548486] [2019-12-07 20:59:23,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:59:23,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:59:23,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:59:23,892 INFO L87 Difference]: Start difference. First operand 148148 states and 606205 transitions. Second operand 4 states. [2019-12-07 20:59:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:25,276 INFO L93 Difference]: Finished difference Result 252801 states and 1028764 transitions. [2019-12-07 20:59:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:59:25,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 20:59:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:25,952 INFO L225 Difference]: With dead ends: 252801 [2019-12-07 20:59:25,952 INFO L226 Difference]: Without dead ends: 245297 [2019-12-07 20:59:25,952 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 20:59:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245297 states. [2019-12-07 20:59:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245297 to 237117. [2019-12-07 20:59:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237117 states. [2019-12-07 20:59:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237117 states to 237117 states and 972501 transitions. [2019-12-07 20:59:36,222 INFO L78 Accepts]: Start accepts. Automaton has 237117 states and 972501 transitions. Word has length 21 [2019-12-07 20:59:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:36,222 INFO L462 AbstractCegarLoop]: Abstraction has 237117 states and 972501 transitions. [2019-12-07 20:59:36,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:59:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 237117 states and 972501 transitions. [2019-12-07 20:59:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:59:36,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:36,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] [2019-12-07 20:59:36,246 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:36,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1182526653, now seen corresponding path program 1 times [2019-12-07 20:59:36,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:36,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706586959] [2019-12-07 20:59:36,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:36,288 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 20:59:36,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706586959] [2019-12-07 20:59:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:36,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:59:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733155176] [2019-12-07 20:59:36,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:59:36,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:59:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:59:36,290 INFO L87 Difference]: Start difference. First operand 237117 states and 972501 transitions. Second operand 5 states. [2019-12-07 20:59:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:38,398 INFO L93 Difference]: Finished difference Result 325902 states and 1312839 transitions. [2019-12-07 20:59:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:59:38,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 20:59:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:39,195 INFO L225 Difference]: With dead ends: 325902 [2019-12-07 20:59:39,195 INFO L226 Difference]: Without dead ends: 325715 [2019-12-07 20:59:39,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:59:43,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325715 states. [2019-12-07 20:59:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325715 to 252695. [2019-12-07 20:59:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252695 states. [2019-12-07 20:59:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252695 states to 252695 states and 1033374 transitions. [2019-12-07 20:59:48,437 INFO L78 Accepts]: Start accepts. Automaton has 252695 states and 1033374 transitions. Word has length 22 [2019-12-07 20:59:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:59:48,437 INFO L462 AbstractCegarLoop]: Abstraction has 252695 states and 1033374 transitions. [2019-12-07 20:59:48,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:59:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 252695 states and 1033374 transitions. [2019-12-07 20:59:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:59:48,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:59:48,461 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] [2019-12-07 20:59:48,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:59:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:59:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2129291057, now seen corresponding path program 1 times [2019-12-07 20:59:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:59:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185378274] [2019-12-07 20:59:48,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:59:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:59:48,506 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 20:59:48,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185378274] [2019-12-07 20:59:48,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:59:48,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:59:48,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162746251] [2019-12-07 20:59:48,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:59:48,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:59:48,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:59:48,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:59:48,508 INFO L87 Difference]: Start difference. First operand 252695 states and 1033374 transitions. Second operand 4 states. [2019-12-07 20:59:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:59:50,320 INFO L93 Difference]: Finished difference Result 346895 states and 1409838 transitions. [2019-12-07 20:59:50,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:59:50,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 20:59:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:59:51,165 INFO L225 Difference]: With dead ends: 346895 [2019-12-07 20:59:51,165 INFO L226 Difference]: Without dead ends: 335391 [2019-12-07 20:59:51,165 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 20:59:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335391 states. [2019-12-07 21:00:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335391 to 254888. [2019-12-07 21:00:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254888 states. [2019-12-07 21:00:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254888 states to 254888 states and 1041259 transitions. [2019-12-07 21:00:03,518 INFO L78 Accepts]: Start accepts. Automaton has 254888 states and 1041259 transitions. Word has length 22 [2019-12-07 21:00:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:03,519 INFO L462 AbstractCegarLoop]: Abstraction has 254888 states and 1041259 transitions. [2019-12-07 21:00:03,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:00:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 254888 states and 1041259 transitions. [2019-12-07 21:00:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:00:03,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:03,546 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] [2019-12-07 21:00:03,546 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash -150132667, now seen corresponding path program 2 times [2019-12-07 21:00:03,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:03,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223339015] [2019-12-07 21:00:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:03,576 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 21:00:03,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223339015] [2019-12-07 21:00:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:00:03,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674890802] [2019-12-07 21:00:03,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:00:03,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:00:03,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:00:03,577 INFO L87 Difference]: Start difference. First operand 254888 states and 1041259 transitions. Second operand 4 states. [2019-12-07 21:00:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:03,800 INFO L93 Difference]: Finished difference Result 65250 states and 223425 transitions. [2019-12-07 21:00:03,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:00:03,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:00:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:03,916 INFO L225 Difference]: With dead ends: 65250 [2019-12-07 21:00:03,916 INFO L226 Difference]: Without dead ends: 65250 [2019-12-07 21:00:03,916 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 21:00:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65250 states. [2019-12-07 21:00:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65250 to 65250. [2019-12-07 21:00:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65250 states. [2019-12-07 21:00:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65250 states to 65250 states and 223425 transitions. [2019-12-07 21:00:04,990 INFO L78 Accepts]: Start accepts. Automaton has 65250 states and 223425 transitions. Word has length 22 [2019-12-07 21:00:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:04,990 INFO L462 AbstractCegarLoop]: Abstraction has 65250 states and 223425 transitions. [2019-12-07 21:00:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:00:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 65250 states and 223425 transitions. [2019-12-07 21:00:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:00:05,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:05,001 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] [2019-12-07 21:00:05,002 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-07 21:00:05,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:05,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687816603] [2019-12-07 21:00:05,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:05,038 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 21:00:05,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687816603] [2019-12-07 21:00:05,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:05,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:00:05,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251935792] [2019-12-07 21:00:05,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:00:05,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:05,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:00:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:00:05,040 INFO L87 Difference]: Start difference. First operand 65250 states and 223425 transitions. Second operand 6 states. [2019-12-07 21:00:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:06,101 INFO L93 Difference]: Finished difference Result 98927 states and 330340 transitions. [2019-12-07 21:00:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:00:06,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 21:00:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:06,268 INFO L225 Difference]: With dead ends: 98927 [2019-12-07 21:00:06,268 INFO L226 Difference]: Without dead ends: 98814 [2019-12-07 21:00:06,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:00:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98814 states. [2019-12-07 21:00:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98814 to 70902. [2019-12-07 21:00:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70902 states. [2019-12-07 21:00:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70902 states to 70902 states and 240427 transitions. [2019-12-07 21:00:07,619 INFO L78 Accepts]: Start accepts. Automaton has 70902 states and 240427 transitions. Word has length 24 [2019-12-07 21:00:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:07,620 INFO L462 AbstractCegarLoop]: Abstraction has 70902 states and 240427 transitions. [2019-12-07 21:00:07,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:00:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 70902 states and 240427 transitions. [2019-12-07 21:00:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:00:07,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:07,647 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 21:00:07,647 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash 790027274, now seen corresponding path program 1 times [2019-12-07 21:00:07,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:07,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798095265] [2019-12-07 21:00:07,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:07,691 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 21:00:07,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798095265] [2019-12-07 21:00:07,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:07,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:00:07,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639951995] [2019-12-07 21:00:07,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:00:07,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:00:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:00:07,693 INFO L87 Difference]: Start difference. First operand 70902 states and 240427 transitions. Second operand 6 states. [2019-12-07 21:00:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:08,677 INFO L93 Difference]: Finished difference Result 97398 states and 325410 transitions. [2019-12-07 21:00:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:00:08,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 21:00:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:08,833 INFO L225 Difference]: With dead ends: 97398 [2019-12-07 21:00:08,833 INFO L226 Difference]: Without dead ends: 97224 [2019-12-07 21:00:08,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:00:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97224 states. [2019-12-07 21:00:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97224 to 72789. [2019-12-07 21:00:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72789 states. [2019-12-07 21:00:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72789 states to 72789 states and 246544 transitions. [2019-12-07 21:00:10,186 INFO L78 Accepts]: Start accepts. Automaton has 72789 states and 246544 transitions. Word has length 30 [2019-12-07 21:00:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:10,186 INFO L462 AbstractCegarLoop]: Abstraction has 72789 states and 246544 transitions. [2019-12-07 21:00:10,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:00:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72789 states and 246544 transitions. [2019-12-07 21:00:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:00:10,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:10,231 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] [2019-12-07 21:00:10,231 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1968017113, now seen corresponding path program 1 times [2019-12-07 21:00:10,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:10,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887146652] [2019-12-07 21:00:10,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:10,266 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 21:00:10,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887146652] [2019-12-07 21:00:10,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:10,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:00:10,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092501585] [2019-12-07 21:00:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:00:10,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:00:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:00:10,267 INFO L87 Difference]: Start difference. First operand 72789 states and 246544 transitions. Second operand 5 states. [2019-12-07 21:00:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:10,397 INFO L93 Difference]: Finished difference Result 35739 states and 124910 transitions. [2019-12-07 21:00:10,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:00:10,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 21:00:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:10,455 INFO L225 Difference]: With dead ends: 35739 [2019-12-07 21:00:10,455 INFO L226 Difference]: Without dead ends: 35739 [2019-12-07 21:00:10,456 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 21:00:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35739 states. [2019-12-07 21:00:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35739 to 29430. [2019-12-07 21:00:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29430 states. [2019-12-07 21:00:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29430 states to 29430 states and 100126 transitions. [2019-12-07 21:00:11,029 INFO L78 Accepts]: Start accepts. Automaton has 29430 states and 100126 transitions. Word has length 33 [2019-12-07 21:00:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:11,029 INFO L462 AbstractCegarLoop]: Abstraction has 29430 states and 100126 transitions. [2019-12-07 21:00:11,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:00:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29430 states and 100126 transitions. [2019-12-07 21:00:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 21:00:11,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:11,061 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] [2019-12-07 21:00:11,061 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-07 21:00:11,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:11,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297987493] [2019-12-07 21:00:11,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:11,127 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 21:00:11,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297987493] [2019-12-07 21:00:11,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:11,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:00:11,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491977842] [2019-12-07 21:00:11,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:00:11,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:00:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:00:11,129 INFO L87 Difference]: Start difference. First operand 29430 states and 100126 transitions. Second operand 7 states. [2019-12-07 21:00:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:11,844 INFO L93 Difference]: Finished difference Result 39155 states and 129781 transitions. [2019-12-07 21:00:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 21:00:11,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 21:00:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:11,899 INFO L225 Difference]: With dead ends: 39155 [2019-12-07 21:00:11,899 INFO L226 Difference]: Without dead ends: 38911 [2019-12-07 21:00:11,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 21:00:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38911 states. [2019-12-07 21:00:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38911 to 29128. [2019-12-07 21:00:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29128 states. [2019-12-07 21:00:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29128 states to 29128 states and 98624 transitions. [2019-12-07 21:00:12,430 INFO L78 Accepts]: Start accepts. Automaton has 29128 states and 98624 transitions. Word has length 42 [2019-12-07 21:00:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:12,430 INFO L462 AbstractCegarLoop]: Abstraction has 29128 states and 98624 transitions. [2019-12-07 21:00:12,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:00:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29128 states and 98624 transitions. [2019-12-07 21:00:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 21:00:12,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:12,462 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] [2019-12-07 21:00:12,462 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:12,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash 799718125, now seen corresponding path program 1 times [2019-12-07 21:00:12,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:12,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38605332] [2019-12-07 21:00:12,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:12,515 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 21:00:12,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38605332] [2019-12-07 21:00:12,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:12,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:00:12,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500466697] [2019-12-07 21:00:12,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:00:12,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:00:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:00:12,517 INFO L87 Difference]: Start difference. First operand 29128 states and 98624 transitions. Second operand 5 states. [2019-12-07 21:00:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:12,913 INFO L93 Difference]: Finished difference Result 43268 states and 145555 transitions. [2019-12-07 21:00:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:00:12,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 21:00:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:12,978 INFO L225 Difference]: With dead ends: 43268 [2019-12-07 21:00:12,978 INFO L226 Difference]: Without dead ends: 43268 [2019-12-07 21:00:12,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:00:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43268 states. [2019-12-07 21:00:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43268 to 36630. [2019-12-07 21:00:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36630 states. [2019-12-07 21:00:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36630 states to 36630 states and 123824 transitions. [2019-12-07 21:00:13,631 INFO L78 Accepts]: Start accepts. Automaton has 36630 states and 123824 transitions. Word has length 43 [2019-12-07 21:00:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:13,632 INFO L462 AbstractCegarLoop]: Abstraction has 36630 states and 123824 transitions. [2019-12-07 21:00:13,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:00:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36630 states and 123824 transitions. [2019-12-07 21:00:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 21:00:13,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:13,671 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] [2019-12-07 21:00:13,671 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash 585685071, now seen corresponding path program 2 times [2019-12-07 21:00:13,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:13,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789824835] [2019-12-07 21:00:13,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:13,714 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 21:00:13,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789824835] [2019-12-07 21:00:13,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:13,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:00:13,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954126589] [2019-12-07 21:00:13,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:00:13,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:00:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:13,715 INFO L87 Difference]: Start difference. First operand 36630 states and 123824 transitions. Second operand 3 states. [2019-12-07 21:00:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:13,807 INFO L93 Difference]: Finished difference Result 29128 states and 97585 transitions. [2019-12-07 21:00:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:00:13,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 21:00:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:13,852 INFO L225 Difference]: With dead ends: 29128 [2019-12-07 21:00:13,852 INFO L226 Difference]: Without dead ends: 29128 [2019-12-07 21:00:13,853 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 21:00:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-07 21:00:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 28798. [2019-12-07 21:00:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-07 21:00:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 96570 transitions. [2019-12-07 21:00:14,286 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 96570 transitions. Word has length 43 [2019-12-07 21:00:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 96570 transitions. [2019-12-07 21:00:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:00:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 96570 transitions. [2019-12-07 21:00:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 21:00:14,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:14,317 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] [2019-12-07 21:00:14,317 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -626667720, now seen corresponding path program 1 times [2019-12-07 21:00:14,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:14,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610703595] [2019-12-07 21:00:14,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:14,364 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 21:00:14,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610703595] [2019-12-07 21:00:14,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:14,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:00:14,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090957649] [2019-12-07 21:00:14,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:00:14,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:14,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:00:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:00:14,366 INFO L87 Difference]: Start difference. First operand 28798 states and 96570 transitions. Second operand 6 states. [2019-12-07 21:00:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:14,478 INFO L93 Difference]: Finished difference Result 26785 states and 91973 transitions. [2019-12-07 21:00:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:00:14,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-07 21:00:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:14,521 INFO L225 Difference]: With dead ends: 26785 [2019-12-07 21:00:14,521 INFO L226 Difference]: Without dead ends: 26557 [2019-12-07 21:00:14,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:00:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26557 states. [2019-12-07 21:00:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26557 to 19072. [2019-12-07 21:00:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19072 states. [2019-12-07 21:00:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19072 states to 19072 states and 67748 transitions. [2019-12-07 21:00:14,877 INFO L78 Accepts]: Start accepts. Automaton has 19072 states and 67748 transitions. Word has length 44 [2019-12-07 21:00:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:14,877 INFO L462 AbstractCegarLoop]: Abstraction has 19072 states and 67748 transitions. [2019-12-07 21:00:14,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:00:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19072 states and 67748 transitions. [2019-12-07 21:00:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:14,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:14,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:14,898 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:14,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1720152494, now seen corresponding path program 1 times [2019-12-07 21:00:14,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:14,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958099643] [2019-12-07 21:00:14,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:14,922 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 21:00:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958099643] [2019-12-07 21:00:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:00:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971402192] [2019-12-07 21:00:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:00:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:00:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:14,923 INFO L87 Difference]: Start difference. First operand 19072 states and 67748 transitions. Second operand 3 states. [2019-12-07 21:00:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:15,012 INFO L93 Difference]: Finished difference Result 26652 states and 94803 transitions. [2019-12-07 21:00:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:00:15,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 21:00:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:15,057 INFO L225 Difference]: With dead ends: 26652 [2019-12-07 21:00:15,057 INFO L226 Difference]: Without dead ends: 26652 [2019-12-07 21:00:15,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26652 states. [2019-12-07 21:00:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26652 to 21912. [2019-12-07 21:00:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21912 states. [2019-12-07 21:00:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21912 states to 21912 states and 78320 transitions. [2019-12-07 21:00:15,507 INFO L78 Accepts]: Start accepts. Automaton has 21912 states and 78320 transitions. Word has length 58 [2019-12-07 21:00:15,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:15,507 INFO L462 AbstractCegarLoop]: Abstraction has 21912 states and 78320 transitions. [2019-12-07 21:00:15,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:00:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21912 states and 78320 transitions. [2019-12-07 21:00:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:15,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:15,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:15,530 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:15,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 54421662, now seen corresponding path program 1 times [2019-12-07 21:00:15,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:15,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187276458] [2019-12-07 21:00:15,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:15,570 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 21:00:15,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187276458] [2019-12-07 21:00:15,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:15,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:00:15,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49626412] [2019-12-07 21:00:15,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:00:15,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:00:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:00:15,571 INFO L87 Difference]: Start difference. First operand 21912 states and 78320 transitions. Second operand 4 states. [2019-12-07 21:00:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:15,669 INFO L93 Difference]: Finished difference Result 31180 states and 106709 transitions. [2019-12-07 21:00:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:00:15,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 21:00:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:15,700 INFO L225 Difference]: With dead ends: 31180 [2019-12-07 21:00:15,700 INFO L226 Difference]: Without dead ends: 20385 [2019-12-07 21:00:15,700 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 21:00:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20385 states. [2019-12-07 21:00:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20385 to 20385. [2019-12-07 21:00:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20385 states. [2019-12-07 21:00:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20385 states to 20385 states and 71965 transitions. [2019-12-07 21:00:16,020 INFO L78 Accepts]: Start accepts. Automaton has 20385 states and 71965 transitions. Word has length 58 [2019-12-07 21:00:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:16,020 INFO L462 AbstractCegarLoop]: Abstraction has 20385 states and 71965 transitions. [2019-12-07 21:00:16,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:00:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 20385 states and 71965 transitions. [2019-12-07 21:00:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:16,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:16,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:16,042 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash 723016660, now seen corresponding path program 2 times [2019-12-07 21:00:16,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:16,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720115075] [2019-12-07 21:00:16,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:16,103 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 21:00:16,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720115075] [2019-12-07 21:00:16,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:16,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:00:16,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061176229] [2019-12-07 21:00:16,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:00:16,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:00:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:00:16,105 INFO L87 Difference]: Start difference. First operand 20385 states and 71965 transitions. Second operand 4 states. [2019-12-07 21:00:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:16,239 INFO L93 Difference]: Finished difference Result 35063 states and 123358 transitions. [2019-12-07 21:00:16,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:00:16,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 21:00:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:16,292 INFO L225 Difference]: With dead ends: 35063 [2019-12-07 21:00:16,292 INFO L226 Difference]: Without dead ends: 32805 [2019-12-07 21:00:16,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:00:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32805 states. [2019-12-07 21:00:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32805 to 19461. [2019-12-07 21:00:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19461 states. [2019-12-07 21:00:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19461 states to 19461 states and 68246 transitions. [2019-12-07 21:00:16,689 INFO L78 Accepts]: Start accepts. Automaton has 19461 states and 68246 transitions. Word has length 58 [2019-12-07 21:00:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 19461 states and 68246 transitions. [2019-12-07 21:00:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:00:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 19461 states and 68246 transitions. [2019-12-07 21:00:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:16,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:16,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:16,710 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1921484756, now seen corresponding path program 3 times [2019-12-07 21:00:16,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:16,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249314766] [2019-12-07 21:00:16,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:16,769 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 21:00:16,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249314766] [2019-12-07 21:00:16,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:16,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:00:16,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429364973] [2019-12-07 21:00:16,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:00:16,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:00:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:00:16,770 INFO L87 Difference]: Start difference. First operand 19461 states and 68246 transitions. Second operand 5 states. [2019-12-07 21:00:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:16,895 INFO L93 Difference]: Finished difference Result 40833 states and 139586 transitions. [2019-12-07 21:00:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:00:16,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 21:00:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:16,914 INFO L225 Difference]: With dead ends: 40833 [2019-12-07 21:00:16,914 INFO L226 Difference]: Without dead ends: 16727 [2019-12-07 21:00:16,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:00:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16727 states. [2019-12-07 21:00:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16727 to 9567. [2019-12-07 21:00:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9567 states. [2019-12-07 21:00:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9567 states to 9567 states and 29200 transitions. [2019-12-07 21:00:17,081 INFO L78 Accepts]: Start accepts. Automaton has 9567 states and 29200 transitions. Word has length 58 [2019-12-07 21:00:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:17,081 INFO L462 AbstractCegarLoop]: Abstraction has 9567 states and 29200 transitions. [2019-12-07 21:00:17,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:00:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9567 states and 29200 transitions. [2019-12-07 21:00:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:17,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:17,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:17,089 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1491599706, now seen corresponding path program 1 times [2019-12-07 21:00:17,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:17,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150051464] [2019-12-07 21:00:17,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:17,107 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 21:00:17,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150051464] [2019-12-07 21:00:17,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:17,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:00:17,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524939347] [2019-12-07 21:00:17,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:00:17,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:17,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:00:17,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:17,108 INFO L87 Difference]: Start difference. First operand 9567 states and 29200 transitions. Second operand 3 states. [2019-12-07 21:00:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:17,149 INFO L93 Difference]: Finished difference Result 10995 states and 32653 transitions. [2019-12-07 21:00:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:00:17,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 21:00:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:17,159 INFO L225 Difference]: With dead ends: 10995 [2019-12-07 21:00:17,159 INFO L226 Difference]: Without dead ends: 10629 [2019-12-07 21:00:17,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10629 states. [2019-12-07 21:00:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10629 to 8297. [2019-12-07 21:00:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8297 states. [2019-12-07 21:00:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 25054 transitions. [2019-12-07 21:00:17,276 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 25054 transitions. Word has length 58 [2019-12-07 21:00:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:17,276 INFO L462 AbstractCegarLoop]: Abstraction has 8297 states and 25054 transitions. [2019-12-07 21:00:17,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:00:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 25054 transitions. [2019-12-07 21:00:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 21:00:17,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:17,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:17,282 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 4 times [2019-12-07 21:00:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:17,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68171735] [2019-12-07 21:00:17,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:00:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:00:17,352 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:00:17,352 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:00:17,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:00:17,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 21:00:17,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-07 21:00:17,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 21:00:17,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-07 21:00:17,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:00:17,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1108669482 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1108669482| |P1Thread1of1ForFork2_#t~ite11_Out-1108669482|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1108669482 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1108669482 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-1108669482 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1108669482 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-1108669482| ~y$w_buff1~0_In-1108669482)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-1108669482| |P1Thread1of1ForFork2_#t~ite11_Out-1108669482|) (= |P1Thread1of1ForFork2_#t~ite12_Out-1108669482| ~y$w_buff1~0_In-1108669482)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1108669482, ~y$w_buff1~0=~y$w_buff1~0_In-1108669482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108669482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1108669482, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1108669482|, ~weak$$choice2~0=~weak$$choice2~0_In-1108669482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108669482} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1108669482, ~y$w_buff1~0=~y$w_buff1~0_In-1108669482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108669482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1108669482, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1108669482|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1108669482|, ~weak$$choice2~0=~weak$$choice2~0_In-1108669482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108669482} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:00:17,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1528009730 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-1528009730| |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|) (= ~y$w_buff0_used~0_In-1528009730 |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1528009730 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1528009730 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1528009730 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1528009730 256) 0)))) (and (= ~y$w_buff0_used~0_In-1528009730 |P1Thread1of1ForFork2_#t~ite15_Out-1528009730|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-1528009730| |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1528009730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1528009730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1528009730, ~weak$$choice2~0=~weak$$choice2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1528009730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1528009730} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1528009730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1528009730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1528009730|, ~weak$$choice2~0=~weak$$choice2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1528009730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1528009730} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 21:00:17,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork2_#t~ite17_Out1423016518| |P1Thread1of1ForFork2_#t~ite18_Out1423016518|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1423016518 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1423016518 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1423016518 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1423016518 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1423016518 256) 0))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) .cse4 .cse5 (= ~y$w_buff1_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite17_Out1423016518|)) (and (= |P1Thread1of1ForFork2_#t~ite17_Out1423016518| |P1Thread1of1ForFork2_#t~ite17_In1423016518|) (not .cse5) (= ~y$w_buff1_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite18_Out1423016518|))) (= |P1Thread1of1ForFork2_#t~ite16_In1423016518| |P1Thread1of1ForFork2_#t~ite16_Out1423016518|)) (let ((.cse6 (not .cse1))) (and .cse4 (= |P1Thread1of1ForFork2_#t~ite16_Out1423016518| |P1Thread1of1ForFork2_#t~ite17_Out1423016518|) .cse5 (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork2_#t~ite16_Out1423016518| 0) (not .cse0) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1423016518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1423016518|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1423016518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 21:00:17,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:00:17,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-288516922 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-288516922 |P1Thread1of1ForFork2_#t~ite24_Out-288516922|) (= |P1Thread1of1ForFork2_#t~ite23_In-288516922| |P1Thread1of1ForFork2_#t~ite23_Out-288516922|) (not .cse0)) (and (= ~y$r_buff1_thd2~0_In-288516922 |P1Thread1of1ForFork2_#t~ite23_Out-288516922|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-288516922 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-288516922 256) 0) (and (= (mod ~y$w_buff1_used~0_In-288516922 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-288516922 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-288516922| |P1Thread1of1ForFork2_#t~ite24_Out-288516922|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-288516922|, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-288516922|, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 21:00:17,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:00:17,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1148785092| |P3Thread1of1ForFork0_#t~ite32_Out1148785092|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1148785092 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1148785092 256)))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In1148785092 |P3Thread1of1ForFork0_#t~ite32_Out1148785092|) (not .cse2)) (and (= ~y~0_In1148785092 |P3Thread1of1ForFork0_#t~ite32_Out1148785092|) .cse0 (or .cse2 .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1148785092, ~y$w_buff1~0=~y$w_buff1~0_In1148785092, ~y~0=~y~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1148785092, ~y$w_buff1~0=~y$w_buff1~0_In1148785092, ~y~0=~y~0_In1148785092, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1148785092|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1148785092|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 21:00:17,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1424065344 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1424065344 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1424065344| ~y$w_buff0_used~0_In1424065344) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out1424065344| 0) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1424065344|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 21:00:17,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1654483330 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1654483330 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1654483330 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1654483330 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out1654483330| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out1654483330| ~y$w_buff1_used~0_In1654483330)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1654483330, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1654483330, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 21:00:17,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In818053462 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In818053462 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out818053462| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out818053462| ~y$r_buff0_thd4~0_In818053462)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In818053462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In818053462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out818053462|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 21:00:17,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-84859877 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-84859877 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-84859877 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-84859877 256) 0))) (or (and (= ~y$r_buff1_thd4~0_In-84859877 |P3Thread1of1ForFork0_#t~ite37_Out-84859877|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-84859877|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-84859877, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-84859877, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-84859877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 21:00:17,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:00:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1751836296 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1751836296 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out1751836296| ~y$w_buff0_used~0_In1751836296)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out1751836296| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1751836296} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1751836296, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1751836296|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 21:00:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1758039681 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1758039681 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1758039681 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758039681 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1758039681|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1758039681 |P2Thread1of1ForFork3_#t~ite29_Out-1758039681|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1758039681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758039681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1758039681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758039681, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1758039681|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In6878931 ~y$r_buff0_thd3~0_Out6878931)) (.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In6878931 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out6878931) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In6878931} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out6878931|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out6878931} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In376260199 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In376260199 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In376260199 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In376260199 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out376260199| ~y$r_buff1_thd3~0_In376260199) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite31_Out376260199| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In376260199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In376260199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376260199} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In376260199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In376260199, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out376260199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376260199} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1421410405 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1421410405 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1421410405| ~y$w_buff1~0_In-1421410405)) (and (or .cse1 .cse0) (= ~y~0_In-1421410405 |ULTIMATE.start_main_#t~ite42_Out-1421410405|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1421410405|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 21:00:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 21:00:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1490412612 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1490412612 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1490412612| ~y$w_buff0_used~0_In1490412612) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1490412612|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1490412612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490412612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1490412612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490412612, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1490412612|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 21:00:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1606857859 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1606857859 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1606857859 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1606857859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1606857859 |ULTIMATE.start_main_#t~ite45_Out1606857859|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1606857859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606857859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1606857859, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1606857859|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606857859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 21:00:17,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-572789 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-572789 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-572789| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-572789| ~y$r_buff0_thd0~0_In-572789)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572789, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-572789|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 21:00:17,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-840265942 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-840265942 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-840265942 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-840265942 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-840265942| ~y$r_buff1_thd0~0_In-840265942) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite47_Out-840265942| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-840265942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840265942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840265942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840265942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-840265942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840265942, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-840265942|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840265942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840265942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:00:17,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:00:17,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:00:17 BasicIcfg [2019-12-07 21:00:17,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:00:17,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:00:17,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:00:17,422 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:00:17,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:57:31" (3/4) ... [2019-12-07 21:00:17,424 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:00:17,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:00:17,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 21:00:17,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-07 21:00:17,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 21:00:17,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-07 21:00:17,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:00:17,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1108669482 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1108669482| |P1Thread1of1ForFork2_#t~ite11_Out-1108669482|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1108669482 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1108669482 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-1108669482 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1108669482 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork2_#t~ite11_Out-1108669482| ~y$w_buff1~0_In-1108669482)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_In-1108669482| |P1Thread1of1ForFork2_#t~ite11_Out-1108669482|) (= |P1Thread1of1ForFork2_#t~ite12_Out-1108669482| ~y$w_buff1~0_In-1108669482)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1108669482, ~y$w_buff1~0=~y$w_buff1~0_In-1108669482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108669482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1108669482, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1108669482|, ~weak$$choice2~0=~weak$$choice2~0_In-1108669482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108669482} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1108669482, ~y$w_buff1~0=~y$w_buff1~0_In-1108669482, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1108669482, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1108669482, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1108669482|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1108669482|, ~weak$$choice2~0=~weak$$choice2~0_In-1108669482, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1108669482} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:00:17,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1528009730 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-1528009730| |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|) (= ~y$w_buff0_used~0_In-1528009730 |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1528009730 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1528009730 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1528009730 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1528009730 256) 0)))) (and (= ~y$w_buff0_used~0_In-1528009730 |P1Thread1of1ForFork2_#t~ite15_Out-1528009730|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-1528009730| |P1Thread1of1ForFork2_#t~ite14_Out-1528009730|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1528009730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1528009730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1528009730, ~weak$$choice2~0=~weak$$choice2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1528009730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1528009730} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1528009730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1528009730, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1528009730|, ~weak$$choice2~0=~weak$$choice2~0_In-1528009730, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1528009730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1528009730} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 21:00:17,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork2_#t~ite17_Out1423016518| |P1Thread1of1ForFork2_#t~ite18_Out1423016518|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1423016518 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1423016518 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1423016518 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1423016518 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1423016518 256) 0))) (or (and (or (and (or .cse0 (and .cse1 .cse2) (and .cse1 .cse3)) .cse4 .cse5 (= ~y$w_buff1_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite17_Out1423016518|)) (and (= |P1Thread1of1ForFork2_#t~ite17_Out1423016518| |P1Thread1of1ForFork2_#t~ite17_In1423016518|) (not .cse5) (= ~y$w_buff1_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite18_Out1423016518|))) (= |P1Thread1of1ForFork2_#t~ite16_In1423016518| |P1Thread1of1ForFork2_#t~ite16_Out1423016518|)) (let ((.cse6 (not .cse1))) (and .cse4 (= |P1Thread1of1ForFork2_#t~ite16_Out1423016518| |P1Thread1of1ForFork2_#t~ite17_Out1423016518|) .cse5 (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork2_#t~ite16_Out1423016518| 0) (not .cse0) (or (not .cse2) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1423016518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1423016518|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1423016518|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-07 21:00:17,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_31|) (not (= 0 (mod v_~weak$$choice2~0_200 256)))) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_30|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_28|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_23|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_35|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_13|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_28|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:00:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-288516922 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-288516922 |P1Thread1of1ForFork2_#t~ite24_Out-288516922|) (= |P1Thread1of1ForFork2_#t~ite23_In-288516922| |P1Thread1of1ForFork2_#t~ite23_Out-288516922|) (not .cse0)) (and (= ~y$r_buff1_thd2~0_In-288516922 |P1Thread1of1ForFork2_#t~ite23_Out-288516922|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-288516922 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-288516922 256) 0) (and (= (mod ~y$w_buff1_used~0_In-288516922 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-288516922 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork2_#t~ite23_Out-288516922| |P1Thread1of1ForFork2_#t~ite24_Out-288516922|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-288516922|, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-288516922, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288516922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-288516922, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-288516922|, ~weak$$choice2~0=~weak$$choice2~0_In-288516922, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-288516922|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 21:00:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_9|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:00:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1148785092| |P3Thread1of1ForFork0_#t~ite32_Out1148785092|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1148785092 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1148785092 256)))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In1148785092 |P3Thread1of1ForFork0_#t~ite32_Out1148785092|) (not .cse2)) (and (= ~y~0_In1148785092 |P3Thread1of1ForFork0_#t~ite32_Out1148785092|) .cse0 (or .cse2 .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1148785092, ~y$w_buff1~0=~y$w_buff1~0_In1148785092, ~y~0=~y~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1148785092, ~y$w_buff1~0=~y$w_buff1~0_In1148785092, ~y~0=~y~0_In1148785092, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1148785092|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1148785092|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 21:00:17,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1424065344 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1424065344 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1424065344| ~y$w_buff0_used~0_In1424065344) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out1424065344| 0) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1424065344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1424065344, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1424065344|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 21:00:17,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1654483330 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1654483330 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1654483330 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1654483330 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out1654483330| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out1654483330| ~y$w_buff1_used~0_In1654483330)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1654483330, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1654483330, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1654483330, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1654483330, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1654483330|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1654483330} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 21:00:17,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In818053462 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In818053462 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out818053462| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out818053462| ~y$r_buff0_thd4~0_In818053462)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In818053462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In818053462, ~y$w_buff0_used~0=~y$w_buff0_used~0_In818053462, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out818053462|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 21:00:17,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-84859877 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In-84859877 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-84859877 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-84859877 256) 0))) (or (and (= ~y$r_buff1_thd4~0_In-84859877 |P3Thread1of1ForFork0_#t~ite37_Out-84859877|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-84859877|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-84859877, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-84859877, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-84859877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 21:00:17,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#t~ite37_52| v_~y$r_buff1_thd4~0_148) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_51|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:00:17,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1751836296 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1751836296 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out1751836296| ~y$w_buff0_used~0_In1751836296)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out1751836296| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1751836296} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1751836296, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1751836296|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 21:00:17,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1758039681 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1758039681 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1758039681 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758039681 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1758039681|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1758039681 |P2Thread1of1ForFork3_#t~ite29_Out-1758039681|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1758039681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758039681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1758039681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1758039681, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1758039681|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In6878931 ~y$r_buff0_thd3~0_Out6878931)) (.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In6878931 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~y$r_buff0_thd3~0_Out6878931) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In6878931} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out6878931|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out6878931} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In376260199 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In376260199 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In376260199 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In376260199 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out376260199| ~y$r_buff1_thd3~0_In376260199) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork3_#t~ite31_Out376260199| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In376260199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In376260199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376260199} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In376260199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In376260199, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out376260199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In376260199} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0) (= |v_P2Thread1of1ForFork3_#t~ite31_46| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_45|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1421410405 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1421410405 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1421410405| ~y$w_buff1~0_In-1421410405)) (and (or .cse1 .cse0) (= ~y~0_In-1421410405 |ULTIMATE.start_main_#t~ite42_Out-1421410405|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1421410405, ~y~0=~y~0_In-1421410405, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1421410405|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1421410405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1421410405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 21:00:17,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 21:00:17,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1490412612 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1490412612 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1490412612| ~y$w_buff0_used~0_In1490412612) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1490412612|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1490412612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490412612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1490412612, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1490412612, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1490412612|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 21:00:17,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1606857859 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1606857859 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1606857859 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1606857859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In1606857859 |ULTIMATE.start_main_#t~ite45_Out1606857859|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1606857859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606857859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1606857859, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1606857859|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1606857859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 21:00:17,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-572789 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-572789 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-572789| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-572789| ~y$r_buff0_thd0~0_In-572789)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572789, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-572789|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 21:00:17,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-840265942 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-840265942 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-840265942 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-840265942 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-840265942| ~y$r_buff1_thd0~0_In-840265942) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite47_Out-840265942| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-840265942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840265942, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840265942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840265942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-840265942, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-840265942, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-840265942|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-840265942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-840265942} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:00:17,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~z~0_155 2) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:00:17,487 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_39915520-33cd-4dbe-ae1f-28132a998950/bin/utaipan/witness.graphml [2019-12-07 21:00:17,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:00:17,488 INFO L168 Benchmark]: Toolchain (without parser) took 167264.92 ms. Allocated memory was 1.0 GB in the beginning and 9.2 GB in the end (delta: 8.2 GB). Free memory was 935.4 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 21:00:17,489 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:00:17,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:00:17,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:00:17,489 INFO L168 Benchmark]: Boogie Preprocessor took 25.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:00:17,490 INFO L168 Benchmark]: RCFGBuilder took 392.15 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:00:17,490 INFO L168 Benchmark]: TraceAbstraction took 166274.62 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 21:00:17,490 INFO L168 Benchmark]: Witness Printer took 65.96 ms. Allocated memory is still 9.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:00:17,491 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 392.15 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 166274.62 ms. Allocated memory was 1.1 GB in the beginning and 9.2 GB in the end (delta: 8.1 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 65.96 ms. Allocated memory is still 9.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L760] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L760] 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) [L761] EXPR 2 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L761] 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)) [L762] 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)) [L763] 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)) [L766] 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)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [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 [L855] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 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 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 166.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3326 SDtfs, 3814 SDslu, 5320 SDs, 0 SdLazy, 3132 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261640occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 108.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 408565 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 154835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...