./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_tso.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_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/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 b19110f000788c08c75af23713839cc8c42dbd78 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:00:27,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:00:27,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:00:27,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:00:27,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:00:27,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:00:27,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:00:28,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:00:28,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:00:28,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:00:28,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:00:28,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:00:28,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:00:28,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:00:28,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:00:28,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:00:28,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:00:28,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:00:28,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:00:28,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:00:28,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:00:28,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:00:28,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:00:28,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:00:28,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:00:28,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:00:28,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:00:28,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:00:28,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:00:28,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:00:28,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:00:28,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:00:28,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:00:28,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:00:28,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:00:28,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:00:28,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:00:28,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:00:28,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:00:28,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:00:28,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:00:28,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:00:28,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:00:28,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:00:28,031 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:00:28,031 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:00:28,031 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:00:28,031 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:00:28,031 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:00:28,031 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:00:28,031 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:00:28,032 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:00:28,032 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:00:28,032 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:00:28,032 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:00:28,032 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:00:28,032 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:00:28,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:00:28,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:00:28,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:00:28,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:00:28,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:00:28,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:00:28,035 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_7bf46d4b-3629-4191-ae8a-6e37936205bd/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 -> b19110f000788c08c75af23713839cc8c42dbd78 [2019-12-07 21:00:28,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:00:28,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:00:28,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:00:28,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:00:28,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:00:28,145 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i [2019-12-07 21:00:28,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/data/bb120f929/830964f5154c42ebab45a4539ebe4b56/FLAG21ded0365 [2019-12-07 21:00:28,634 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:00:28,634 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i [2019-12-07 21:00:28,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/data/bb120f929/830964f5154c42ebab45a4539ebe4b56/FLAG21ded0365 [2019-12-07 21:00:28,653 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/data/bb120f929/830964f5154c42ebab45a4539ebe4b56 [2019-12-07 21:00:28,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:00:28,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:00:28,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:00:28,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:00:28,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:00:28,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:00:28" (1/1) ... [2019-12-07 21:00:28,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:28, skipping insertion in model container [2019-12-07 21:00:28,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:00:28" (1/1) ... [2019-12-07 21:00:28,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:00:28,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:00:28,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:00:28,948 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:00:28,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:00:29,044 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:00:29,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29 WrapperNode [2019-12-07 21:00:29,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:00:29,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:00:29,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:00:29,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:00:29,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:00:29,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:00:29,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:00:29,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:00:29,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... [2019-12-07 21:00:29,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:00:29,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:00:29,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:00:29,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:00:29,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/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 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:00:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:00:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:00:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:00:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:00:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:00:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:00:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:00:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:00:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:00:29,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:00:29,161 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 21:00:29,567 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:00:29,567 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:00:29,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:00:29 BoogieIcfgContainer [2019-12-07 21:00:29,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:00:29,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:00:29,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:00:29,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:00:29,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:00:28" (1/3) ... [2019-12-07 21:00:29,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:00:29, skipping insertion in model container [2019-12-07 21:00:29,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:00:29" (2/3) ... [2019-12-07 21:00:29,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:00:29, skipping insertion in model container [2019-12-07 21:00:29,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:00:29" (3/3) ... [2019-12-07 21:00:29,573 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_tso.opt.i [2019-12-07 21:00:29,579 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:00:29,579 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:00:29,584 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:00:29,584 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:00:29,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,615 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:00:29,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:00:29,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:00:29,671 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:00:29,671 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:00:29,671 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:00:29,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:00:29,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:00:29,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:00:29,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:00:29,685 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 21:00:29,686 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:00:29,755 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:00:29,755 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:00:29,767 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:00:29,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:00:29,830 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:00:29,830 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:00:29,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:00:29,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 21:00:29,865 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:00:33,477 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 21:00:33,785 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 21:00:33,903 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 21:00:33,903 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 21:00:33,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 21:00:42,185 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 21:00:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 21:00:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:00:42,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:42,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:42,192 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:42,196 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 21:00:42,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:42,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001418550] [2019-12-07 21:00:42,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:42,359 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:42,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001418550] [2019-12-07 21:00:42,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:42,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:00:42,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844311504] [2019-12-07 21:00:42,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:00:42,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:00:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:00:42,375 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 21:00:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:43,076 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 21:00:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:00:43,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:00:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:43,558 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 21:00:43,558 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 21:00:43,559 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 21:00:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 21:00:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 21:00:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 21:00:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 21:00:46,634 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 21:00:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:46,635 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 21:00:46,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:00:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 21:00:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:00:46,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:46,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:46,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 21:00:46,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:46,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858974322] [2019-12-07 21:00:46,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:46,720 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:46,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858974322] [2019-12-07 21:00:46,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:46,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:00:46,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309733708] [2019-12-07 21:00:46,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:00:46,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:00:46,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:00:46,722 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 21:00:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:48,844 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 21:00:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:00:48,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:00:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:49,213 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 21:00:49,213 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 21:00:49,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 21:00:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 21:00:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 21:00:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 21:00:53,114 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 21:00:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:00:53,114 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 21:00:53,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:00:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 21:00:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:00:53,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:00:53,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:00:53,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:00:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:00:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 21:00:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:00:53,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333977284] [2019-12-07 21:00:53,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:00:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:00:53,176 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:53,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333977284] [2019-12-07 21:00:53,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:00:53,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:00:53,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213034166] [2019-12-07 21:00:53,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:00:53,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:00:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:00:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:00:53,178 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 21:00:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:00:54,356 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 21:00:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:00:54,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:00:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:00:54,827 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 21:00:54,827 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 21:00:54,827 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:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 21:01:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 21:01:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 21:01:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 21:01:01,055 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 21:01:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:01,055 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 21:01:01,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:01:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 21:01:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:01:01,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:01,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:01:01,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:01,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 21:01:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:01,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498690971] [2019-12-07 21:01:01,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:01,094 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:01:01,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498690971] [2019-12-07 21:01:01,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:01,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:01:01,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796590881] [2019-12-07 21:01:01,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:01:01,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:01,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:01:01,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:01:01,096 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 21:01:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:02,361 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 21:01:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:01:02,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 21:01:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:01:03,082 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 21:01:03,083 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 21:01:03,083 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:01:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 21:01:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 21:01:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 21:01:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 21:01:12,462 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 21:01:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:12,462 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 21:01:12,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:01:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 21:01:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:01:12,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:12,477 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 21:01:12,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 21:01:12,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:12,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930114552] [2019-12-07 21:01:12,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:12,523 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:01:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930114552] [2019-12-07 21:01:12,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:12,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:01:12,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481550785] [2019-12-07 21:01:12,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:01:12,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:01:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:01:12,525 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 21:01:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:13,580 INFO L93 Difference]: Finished difference Result 207942 states and 891892 transitions. [2019-12-07 21:01:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:01:13,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:01:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:01:14,186 INFO L225 Difference]: With dead ends: 207942 [2019-12-07 21:01:14,186 INFO L226 Difference]: Without dead ends: 207942 [2019-12-07 21:01:14,187 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:01:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207942 states. [2019-12-07 21:01:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207942 to 205878. [2019-12-07 21:01:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205878 states. [2019-12-07 21:01:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205878 states to 205878 states and 883844 transitions. [2019-12-07 21:01:23,669 INFO L78 Accepts]: Start accepts. Automaton has 205878 states and 883844 transitions. Word has length 20 [2019-12-07 21:01:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:23,670 INFO L462 AbstractCegarLoop]: Abstraction has 205878 states and 883844 transitions. [2019-12-07 21:01:23,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:01:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 205878 states and 883844 transitions. [2019-12-07 21:01:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:01:23,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:23,681 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 21:01:23,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1422939487, now seen corresponding path program 1 times [2019-12-07 21:01:23,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:23,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127253884] [2019-12-07 21:01:23,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:23,737 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:01:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127253884] [2019-12-07 21:01:23,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:01:23,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39378105] [2019-12-07 21:01:23,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:01:23,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:01:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:01:23,739 INFO L87 Difference]: Start difference. First operand 205878 states and 883844 transitions. Second operand 3 states. [2019-12-07 21:01:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:24,942 INFO L93 Difference]: Finished difference Result 271349 states and 1099719 transitions. [2019-12-07 21:01:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:01:24,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:01:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:01:25,679 INFO L225 Difference]: With dead ends: 271349 [2019-12-07 21:01:25,679 INFO L226 Difference]: Without dead ends: 270911 [2019-12-07 21:01:25,679 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 21:01:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270911 states. [2019-12-07 21:01:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270911 to 264871. [2019-12-07 21:01:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264871 states. [2019-12-07 21:01:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264871 states to 264871 states and 1082715 transitions. [2019-12-07 21:01:33,482 INFO L78 Accepts]: Start accepts. Automaton has 264871 states and 1082715 transitions. Word has length 20 [2019-12-07 21:01:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:33,482 INFO L462 AbstractCegarLoop]: Abstraction has 264871 states and 1082715 transitions. [2019-12-07 21:01:33,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:01:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 264871 states and 1082715 transitions. [2019-12-07 21:01:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:01:33,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:33,497 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 21:01:33,497 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:33,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash -346227298, now seen corresponding path program 1 times [2019-12-07 21:01:33,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:33,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79685189] [2019-12-07 21:01:33,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:33,559 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:01:33,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79685189] [2019-12-07 21:01:33,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:33,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:01:33,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169573086] [2019-12-07 21:01:33,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:01:33,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:33,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:01:33,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:01:33,561 INFO L87 Difference]: Start difference. First operand 264871 states and 1082715 transitions. Second operand 4 states. [2019-12-07 21:01:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:34,754 INFO L93 Difference]: Finished difference Result 260883 states and 1063625 transitions. [2019-12-07 21:01:34,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:01:34,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:01:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:01:35,446 INFO L225 Difference]: With dead ends: 260883 [2019-12-07 21:01:35,446 INFO L226 Difference]: Without dead ends: 260883 [2019-12-07 21:01:35,447 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 21:01:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260883 states. [2019-12-07 21:01:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260883 to 221554. [2019-12-07 21:01:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221554 states. [2019-12-07 21:01:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221554 states to 221554 states and 931574 transitions. [2019-12-07 21:01:45,529 INFO L78 Accepts]: Start accepts. Automaton has 221554 states and 931574 transitions. Word has length 21 [2019-12-07 21:01:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:45,529 INFO L462 AbstractCegarLoop]: Abstraction has 221554 states and 931574 transitions. [2019-12-07 21:01:45,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:01:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 221554 states and 931574 transitions. [2019-12-07 21:01:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:01:45,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:45,542 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 21:01:45,542 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 21:01:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:45,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870804054] [2019-12-07 21:01:45,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:45,584 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:01:45,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870804054] [2019-12-07 21:01:45,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:45,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:01:45,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209526943] [2019-12-07 21:01:45,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:01:45,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:45,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:01:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:01:45,585 INFO L87 Difference]: Start difference. First operand 221554 states and 931574 transitions. Second operand 4 states. [2019-12-07 21:01:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:47,444 INFO L93 Difference]: Finished difference Result 275045 states and 1145051 transitions. [2019-12-07 21:01:47,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:01:47,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:01:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:01:48,186 INFO L225 Difference]: With dead ends: 275045 [2019-12-07 21:01:48,187 INFO L226 Difference]: Without dead ends: 274977 [2019-12-07 21:01:48,187 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:01:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274977 states. [2019-12-07 21:01:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274977 to 225042. [2019-12-07 21:01:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225042 states. [2019-12-07 21:01:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225042 states to 225042 states and 945884 transitions. [2019-12-07 21:01:55,328 INFO L78 Accepts]: Start accepts. Automaton has 225042 states and 945884 transitions. Word has length 21 [2019-12-07 21:01:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:01:55,329 INFO L462 AbstractCegarLoop]: Abstraction has 225042 states and 945884 transitions. [2019-12-07 21:01:55,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:01:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 225042 states and 945884 transitions. [2019-12-07 21:01:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:01:55,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:01:55,357 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:01:55,358 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:01:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:01:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 21:01:55,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:01:55,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868582471] [2019-12-07 21:01:55,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:01:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:01:55,402 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:01:55,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868582471] [2019-12-07 21:01:55,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:01:55,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:01:55,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833349021] [2019-12-07 21:01:55,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:01:55,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:01:55,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:01:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:01:55,404 INFO L87 Difference]: Start difference. First operand 225042 states and 945884 transitions. Second operand 5 states. [2019-12-07 21:01:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:01:57,319 INFO L93 Difference]: Finished difference Result 319033 states and 1317689 transitions. [2019-12-07 21:01:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:01:57,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 21:01:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:01,141 INFO L225 Difference]: With dead ends: 319033 [2019-12-07 21:02:01,142 INFO L226 Difference]: Without dead ends: 318977 [2019-12-07 21:02:01,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 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 21:02:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318977 states. [2019-12-07 21:02:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318977 to 242837. [2019-12-07 21:02:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242837 states. [2019-12-07 21:02:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242837 states to 242837 states and 1018616 transitions. [2019-12-07 21:02:08,629 INFO L78 Accepts]: Start accepts. Automaton has 242837 states and 1018616 transitions. Word has length 24 [2019-12-07 21:02:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:08,629 INFO L462 AbstractCegarLoop]: Abstraction has 242837 states and 1018616 transitions. [2019-12-07 21:02:08,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:02:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 242837 states and 1018616 transitions. [2019-12-07 21:02:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:02:08,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:08,691 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] [2019-12-07 21:02:08,691 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:02:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1719472782, now seen corresponding path program 1 times [2019-12-07 21:02:08,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:08,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962735851] [2019-12-07 21:02:08,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:08,749 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:02:08,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962735851] [2019-12-07 21:02:08,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:08,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:08,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662075446] [2019-12-07 21:02:08,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:02:08,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:02:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:02:08,750 INFO L87 Difference]: Start difference. First operand 242837 states and 1018616 transitions. Second operand 5 states. [2019-12-07 21:02:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:10,704 INFO L93 Difference]: Finished difference Result 330671 states and 1365544 transitions. [2019-12-07 21:02:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:02:10,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 21:02:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:12,150 INFO L225 Difference]: With dead ends: 330671 [2019-12-07 21:02:12,150 INFO L226 Difference]: Without dead ends: 330559 [2019-12-07 21:02:12,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 21:02:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330559 states. [2019-12-07 21:02:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330559 to 229610. [2019-12-07 21:02:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229610 states. [2019-12-07 21:02:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229610 states to 229610 states and 963320 transitions. [2019-12-07 21:02:19,429 INFO L78 Accepts]: Start accepts. Automaton has 229610 states and 963320 transitions. Word has length 27 [2019-12-07 21:02:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:19,429 INFO L462 AbstractCegarLoop]: Abstraction has 229610 states and 963320 transitions. [2019-12-07 21:02:19,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:02:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 229610 states and 963320 transitions. [2019-12-07 21:02:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 21:02:20,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:20,013 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] [2019-12-07 21:02:20,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:02:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 262911733, now seen corresponding path program 1 times [2019-12-07 21:02:20,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:20,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280234270] [2019-12-07 21:02:20,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:20,065 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:02:20,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280234270] [2019-12-07 21:02:20,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:20,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:20,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666264174] [2019-12-07 21:02:20,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:02:20,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:20,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:02:20,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:02:20,067 INFO L87 Difference]: Start difference. First operand 229610 states and 963320 transitions. Second operand 4 states. [2019-12-07 21:02:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:21,307 INFO L93 Difference]: Finished difference Result 268059 states and 1089512 transitions. [2019-12-07 21:02:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:02:21,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 21:02:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:22,018 INFO L225 Difference]: With dead ends: 268059 [2019-12-07 21:02:22,018 INFO L226 Difference]: Without dead ends: 268059 [2019-12-07 21:02:22,018 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 21:02:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268059 states. [2019-12-07 21:02:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268059 to 228274. [2019-12-07 21:02:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228274 states. [2019-12-07 21:02:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228274 states to 228274 states and 956382 transitions. [2019-12-07 21:02:31,245 INFO L78 Accepts]: Start accepts. Automaton has 228274 states and 956382 transitions. Word has length 35 [2019-12-07 21:02:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:31,246 INFO L462 AbstractCegarLoop]: Abstraction has 228274 states and 956382 transitions. [2019-12-07 21:02:31,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:02:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 228274 states and 956382 transitions. [2019-12-07 21:02:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:02:31,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:31,436 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] [2019-12-07 21:02:31,437 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:02:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1013939211, now seen corresponding path program 1 times [2019-12-07 21:02:31,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:31,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880088565] [2019-12-07 21:02:31,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:31,496 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:02:31,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880088565] [2019-12-07 21:02:31,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:31,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:31,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392527813] [2019-12-07 21:02:31,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:02:31,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:31,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:02:31,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:02:31,498 INFO L87 Difference]: Start difference. First operand 228274 states and 956382 transitions. Second operand 4 states. [2019-12-07 21:02:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:33,121 INFO L93 Difference]: Finished difference Result 277255 states and 1114196 transitions. [2019-12-07 21:02:33,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:02:33,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 21:02:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:33,686 INFO L225 Difference]: With dead ends: 277255 [2019-12-07 21:02:33,686 INFO L226 Difference]: Without dead ends: 214325 [2019-12-07 21:02:33,686 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:02:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214325 states. [2019-12-07 21:02:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214325 to 198602. [2019-12-07 21:02:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198602 states. [2019-12-07 21:02:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198602 states to 198602 states and 798763 transitions. [2019-12-07 21:02:39,528 INFO L78 Accepts]: Start accepts. Automaton has 198602 states and 798763 transitions. Word has length 36 [2019-12-07 21:02:39,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:39,528 INFO L462 AbstractCegarLoop]: Abstraction has 198602 states and 798763 transitions. [2019-12-07 21:02:39,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:02:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 198602 states and 798763 transitions. [2019-12-07 21:02:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:02:39,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:39,717 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] [2019-12-07 21:02:39,717 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:02:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1981311576, now seen corresponding path program 1 times [2019-12-07 21:02:39,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:39,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511541496] [2019-12-07 21:02:39,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:39,811 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:02:39,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511541496] [2019-12-07 21:02:39,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:39,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:02:39,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846806339] [2019-12-07 21:02:39,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:02:39,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:02:39,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:02:39,813 INFO L87 Difference]: Start difference. First operand 198602 states and 798763 transitions. Second operand 8 states. [2019-12-07 21:02:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:42,595 INFO L93 Difference]: Finished difference Result 413818 states and 1666850 transitions. [2019-12-07 21:02:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 21:02:42,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 21:02:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:43,736 INFO L225 Difference]: With dead ends: 413818 [2019-12-07 21:02:43,736 INFO L226 Difference]: Without dead ends: 413818 [2019-12-07 21:02:43,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-07 21:02:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413818 states. [2019-12-07 21:02:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413818 to 318974. [2019-12-07 21:02:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318974 states. [2019-12-07 21:02:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318974 states to 318974 states and 1293389 transitions. [2019-12-07 21:02:56,443 INFO L78 Accepts]: Start accepts. Automaton has 318974 states and 1293389 transitions. Word has length 36 [2019-12-07 21:02:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:56,443 INFO L462 AbstractCegarLoop]: Abstraction has 318974 states and 1293389 transitions. [2019-12-07 21:02:56,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:02:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 318974 states and 1293389 transitions. [2019-12-07 21:02:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:02:56,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:56,770 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] [2019-12-07 21:02:56,770 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:02:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:56,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1204663696, now seen corresponding path program 2 times [2019-12-07 21:02:56,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:56,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018023724] [2019-12-07 21:02:56,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:56,866 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:02:56,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018023724] [2019-12-07 21:02:56,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:56,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:56,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077402443] [2019-12-07 21:02:56,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:02:56,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:02:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:02:56,867 INFO L87 Difference]: Start difference. First operand 318974 states and 1293389 transitions. Second operand 7 states. [2019-12-07 21:03:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:00,578 INFO L93 Difference]: Finished difference Result 573560 states and 2317223 transitions. [2019-12-07 21:03:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:03:00,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-07 21:03:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:02,201 INFO L225 Difference]: With dead ends: 573560 [2019-12-07 21:03:02,201 INFO L226 Difference]: Without dead ends: 573560 [2019-12-07 21:03:02,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:03:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573560 states. [2019-12-07 21:03:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573560 to 336766. [2019-12-07 21:03:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336766 states. [2019-12-07 21:03:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336766 states to 336766 states and 1363069 transitions. [2019-12-07 21:03:20,663 INFO L78 Accepts]: Start accepts. Automaton has 336766 states and 1363069 transitions. Word has length 36 [2019-12-07 21:03:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:20,663 INFO L462 AbstractCegarLoop]: Abstraction has 336766 states and 1363069 transitions. [2019-12-07 21:03:20,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:03:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 336766 states and 1363069 transitions. [2019-12-07 21:03:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:03:21,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:21,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:21,065 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -439671128, now seen corresponding path program 3 times [2019-12-07 21:03:21,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:21,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989423823] [2019-12-07 21:03:21,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:03:21,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989423823] [2019-12-07 21:03:21,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:21,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:03:21,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386090776] [2019-12-07 21:03:21,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:03:21,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:21,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:03:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:03:21,157 INFO L87 Difference]: Start difference. First operand 336766 states and 1363069 transitions. Second operand 10 states. [2019-12-07 21:03:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:24,988 INFO L93 Difference]: Finished difference Result 665949 states and 2678557 transitions. [2019-12-07 21:03:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 21:03:24,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 21:03:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:27,000 INFO L225 Difference]: With dead ends: 665949 [2019-12-07 21:03:27,000 INFO L226 Difference]: Without dead ends: 557409 [2019-12-07 21:03:27,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:03:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557409 states. [2019-12-07 21:03:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557409 to 433830. [2019-12-07 21:03:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433830 states. [2019-12-07 21:03:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433830 states to 433830 states and 1761472 transitions. [2019-12-07 21:03:40,793 INFO L78 Accepts]: Start accepts. Automaton has 433830 states and 1761472 transitions. Word has length 36 [2019-12-07 21:03:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:40,793 INFO L462 AbstractCegarLoop]: Abstraction has 433830 states and 1761472 transitions. [2019-12-07 21:03:40,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:03:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 433830 states and 1761472 transitions. [2019-12-07 21:03:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:03:41,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:41,314 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] [2019-12-07 21:03:41,315 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:41,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash 262926389, now seen corresponding path program 1 times [2019-12-07 21:03:41,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:41,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907873004] [2019-12-07 21:03:41,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:41,362 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:03:41,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907873004] [2019-12-07 21:03:41,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:41,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:03:41,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850678927] [2019-12-07 21:03:41,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:03:41,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:03:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:03:41,363 INFO L87 Difference]: Start difference. First operand 433830 states and 1761472 transitions. Second operand 5 states. [2019-12-07 21:03:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:41,938 INFO L93 Difference]: Finished difference Result 156094 states and 531606 transitions. [2019-12-07 21:03:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:03:41,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 21:03:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:42,192 INFO L225 Difference]: With dead ends: 156094 [2019-12-07 21:03:42,192 INFO L226 Difference]: Without dead ends: 132866 [2019-12-07 21:03:42,193 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 21:03:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132866 states. [2019-12-07 21:03:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132866 to 132337. [2019-12-07 21:03:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132337 states. [2019-12-07 21:03:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132337 states to 132337 states and 438896 transitions. [2019-12-07 21:03:49,457 INFO L78 Accepts]: Start accepts. Automaton has 132337 states and 438896 transitions. Word has length 37 [2019-12-07 21:03:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:49,457 INFO L462 AbstractCegarLoop]: Abstraction has 132337 states and 438896 transitions. [2019-12-07 21:03:49,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:03:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 132337 states and 438896 transitions. [2019-12-07 21:03:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 21:03:49,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:49,560 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] [2019-12-07 21:03:49,560 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash 445827019, now seen corresponding path program 1 times [2019-12-07 21:03:49,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:49,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081457062] [2019-12-07 21:03:49,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:49,615 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:03:49,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081457062] [2019-12-07 21:03:49,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:49,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:03:49,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474830130] [2019-12-07 21:03:49,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:03:49,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:03:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:03:49,616 INFO L87 Difference]: Start difference. First operand 132337 states and 438896 transitions. Second operand 6 states. [2019-12-07 21:03:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:49,750 INFO L93 Difference]: Finished difference Result 31902 states and 101085 transitions. [2019-12-07 21:03:49,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:03:49,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 21:03:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:49,792 INFO L225 Difference]: With dead ends: 31902 [2019-12-07 21:03:49,792 INFO L226 Difference]: Without dead ends: 25604 [2019-12-07 21:03:49,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:03:49,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25604 states. [2019-12-07 21:03:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25604 to 23222. [2019-12-07 21:03:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2019-12-07 21:03:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 72508 transitions. [2019-12-07 21:03:50,140 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 72508 transitions. Word has length 38 [2019-12-07 21:03:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:50,140 INFO L462 AbstractCegarLoop]: Abstraction has 23222 states and 72508 transitions. [2019-12-07 21:03:50,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:03:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 72508 transitions. [2019-12-07 21:03:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:03:50,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:50,164 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] [2019-12-07 21:03:50,164 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:50,164 INFO L82 PathProgramCache]: Analyzing trace with hash 951052415, now seen corresponding path program 1 times [2019-12-07 21:03:50,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:50,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693514011] [2019-12-07 21:03:50,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:50,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 21:03:50,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693514011] [2019-12-07 21:03:50,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:50,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:03:50,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929298148] [2019-12-07 21:03:50,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:03:50,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:03:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:03:50,217 INFO L87 Difference]: Start difference. First operand 23222 states and 72508 transitions. Second operand 4 states. [2019-12-07 21:03:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:50,314 INFO L93 Difference]: Finished difference Result 25673 states and 78617 transitions. [2019-12-07 21:03:50,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:03:50,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 21:03:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:50,350 INFO L225 Difference]: With dead ends: 25673 [2019-12-07 21:03:50,350 INFO L226 Difference]: Without dead ends: 25030 [2019-12-07 21:03:50,350 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:03:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25030 states. [2019-12-07 21:03:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25030 to 24147. [2019-12-07 21:03:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24147 states. [2019-12-07 21:03:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24147 states to 24147 states and 74585 transitions. [2019-12-07 21:03:50,701 INFO L78 Accepts]: Start accepts. Automaton has 24147 states and 74585 transitions. Word has length 49 [2019-12-07 21:03:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:50,701 INFO L462 AbstractCegarLoop]: Abstraction has 24147 states and 74585 transitions. [2019-12-07 21:03:50,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:03:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 24147 states and 74585 transitions. [2019-12-07 21:03:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:03:50,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:50,725 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] [2019-12-07 21:03:50,725 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -506273965, now seen corresponding path program 2 times [2019-12-07 21:03:50,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:50,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359343045] [2019-12-07 21:03:50,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:50,780 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:03:50,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359343045] [2019-12-07 21:03:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:03:50,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529236858] [2019-12-07 21:03:50,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:03:50,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:03:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:03:50,781 INFO L87 Difference]: Start difference. First operand 24147 states and 74585 transitions. Second operand 7 states. [2019-12-07 21:03:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:50,893 INFO L93 Difference]: Finished difference Result 21492 states and 68582 transitions. [2019-12-07 21:03:50,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:03:50,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 21:03:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:50,914 INFO L225 Difference]: With dead ends: 21492 [2019-12-07 21:03:50,914 INFO L226 Difference]: Without dead ends: 15300 [2019-12-07 21:03:50,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:03:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15300 states. [2019-12-07 21:03:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15300 to 12015. [2019-12-07 21:03:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-07 21:03:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 36829 transitions. [2019-12-07 21:03:51,085 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 36829 transitions. Word has length 49 [2019-12-07 21:03:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:51,085 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 36829 transitions. [2019-12-07 21:03:51,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:03:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 36829 transitions. [2019-12-07 21:03:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:03:51,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:51,096 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:51,096 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1486943137, now seen corresponding path program 1 times [2019-12-07 21:03:51,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:51,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13831078] [2019-12-07 21:03:51,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:51,129 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:03:51,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13831078] [2019-12-07 21:03:51,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:51,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:03:51,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176132152] [2019-12-07 21:03:51,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:03:51,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:51,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:03:51,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:03:51,130 INFO L87 Difference]: Start difference. First operand 12015 states and 36829 transitions. Second operand 4 states. [2019-12-07 21:03:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:51,171 INFO L93 Difference]: Finished difference Result 13592 states and 41167 transitions. [2019-12-07 21:03:51,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:03:51,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:03:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:51,177 INFO L225 Difference]: With dead ends: 13592 [2019-12-07 21:03:51,177 INFO L226 Difference]: Without dead ends: 6051 [2019-12-07 21:03:51,178 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:03:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2019-12-07 21:03:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 6051. [2019-12-07 21:03:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6051 states. [2019-12-07 21:03:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6051 states to 6051 states and 16064 transitions. [2019-12-07 21:03:51,239 INFO L78 Accepts]: Start accepts. Automaton has 6051 states and 16064 transitions. Word has length 65 [2019-12-07 21:03:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:51,239 INFO L462 AbstractCegarLoop]: Abstraction has 6051 states and 16064 transitions. [2019-12-07 21:03:51,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:03:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6051 states and 16064 transitions. [2019-12-07 21:03:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:03:51,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:51,243 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:51,243 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash -505309043, now seen corresponding path program 2 times [2019-12-07 21:03:51,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:51,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848345955] [2019-12-07 21:03:51,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:51,306 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:03:51,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848345955] [2019-12-07 21:03:51,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:51,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:03:51,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817098971] [2019-12-07 21:03:51,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:03:51,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:51,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:03:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:03:51,307 INFO L87 Difference]: Start difference. First operand 6051 states and 16064 transitions. Second operand 4 states. [2019-12-07 21:03:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:51,340 INFO L93 Difference]: Finished difference Result 6563 states and 17221 transitions. [2019-12-07 21:03:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:03:51,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:03:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:51,344 INFO L225 Difference]: With dead ends: 6563 [2019-12-07 21:03:51,344 INFO L226 Difference]: Without dead ends: 4998 [2019-12-07 21:03:51,344 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:03:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-07 21:03:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4569. [2019-12-07 21:03:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4569 states. [2019-12-07 21:03:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 4569 states and 12315 transitions. [2019-12-07 21:03:51,391 INFO L78 Accepts]: Start accepts. Automaton has 4569 states and 12315 transitions. Word has length 65 [2019-12-07 21:03:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:51,392 INFO L462 AbstractCegarLoop]: Abstraction has 4569 states and 12315 transitions. [2019-12-07 21:03:51,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:03:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4569 states and 12315 transitions. [2019-12-07 21:03:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:03:51,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:51,395 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:51,395 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash -396636243, now seen corresponding path program 3 times [2019-12-07 21:03:51,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:51,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549146920] [2019-12-07 21:03:51,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:51,450 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:03:51,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549146920] [2019-12-07 21:03:51,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:51,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:03:51,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936956429] [2019-12-07 21:03:51,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:03:51,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:51,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:03:51,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:03:51,451 INFO L87 Difference]: Start difference. First operand 4569 states and 12315 transitions. Second operand 5 states. [2019-12-07 21:03:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:51,533 INFO L93 Difference]: Finished difference Result 5042 states and 13371 transitions. [2019-12-07 21:03:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:03:51,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 21:03:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:51,534 INFO L225 Difference]: With dead ends: 5042 [2019-12-07 21:03:51,534 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 21:03:51,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:03:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 21:03:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 21:03:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 21:03:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 21:03:51,539 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 65 [2019-12-07 21:03:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:51,539 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 21:03:51,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:03:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 21:03:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:03:51,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:51,540 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:51,540 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 1 times [2019-12-07 21:03:51,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:51,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734229246] [2019-12-07 21:03:51,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:03:51,603 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:03:51,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734229246] [2019-12-07 21:03:51,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:03:51,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:03:51,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574981109] [2019-12-07 21:03:51,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:03:51,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:03:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:03:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:03:51,605 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 21:03:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:03:51,765 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 21:03:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:03:51,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 21:03:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:03:51,766 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 21:03:51,766 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 21:03:51,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:03:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 21:03:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 21:03:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 21:03:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 21:03:51,772 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 21:03:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:03:51,772 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 21:03:51,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:03:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 21:03:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:03:51,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:03:51,773 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:03:51,773 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:03:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:03:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 2 times [2019-12-07 21:03:51,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:03:51,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851432315] [2019-12-07 21:03:51,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:03:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:03:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:03:51,861 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:03:51,861 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:03:51,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38|) |v_ULTIMATE.start_main_~#t493~0.offset_25| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t493~0.base_38|) (= |v_ULTIMATE.start_main_~#t493~0.offset_25| 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t493~0.base_38| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_22|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t493~0.offset=|v_ULTIMATE.start_main_~#t493~0.offset_25|, ULTIMATE.start_main_~#t493~0.base=|v_ULTIMATE.start_main_~#t493~0.base_38|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_30|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_40|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t496~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t493~0.offset, ULTIMATE.start_main_~#t493~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t496~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t495~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t495~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t494~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t494~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:03:51,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t494~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t494~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t494~0.base_11|) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t494~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11|) |v_ULTIMATE.start_main_~#t494~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t494~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t494~0.offset] because there is no mapped edge [2019-12-07 21:03:51,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t495~0.offset_11|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t495~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t495~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t495~0.base_11| 4)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11| 1)) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11|) |v_ULTIMATE.start_main_~#t495~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t495~0.base, #length, ULTIMATE.start_main_~#t495~0.offset] because there is no mapped edge [2019-12-07 21:03:51,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9|) |v_ULTIMATE.start_main_~#t496~0.offset_8| 3)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t496~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t496~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t496~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t496~0.offset] because there is no mapped edge [2019-12-07 21:03:51,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542)) (= ~z$r_buff0_thd4~0_Out285175542 1) (= ~weak$$choice2~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet27_In285175542|) (= ~z$r_buff1_thd2~0_Out285175542 ~z$r_buff0_thd2~0_In285175542) (= ~z~0_In285175542 ~z$mem_tmp~0_Out285175542) (= ~z$r_buff0_thd3~0_In285175542 ~z$r_buff1_thd3~0_Out285175542) (= ~z$r_buff1_thd4~0_Out285175542 ~z$r_buff0_thd4~0_In285175542) (= ~z$r_buff0_thd1~0_In285175542 ~z$r_buff1_thd1~0_Out285175542) (= ~weak$$choice0~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet26_In285175542|) (= ~weak$$choice2~0_Out285175542 ~z$flush_delayed~0_Out285175542) (= ~z$r_buff0_thd0~0_In285175542 ~z$r_buff1_thd0~0_Out285175542)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In285175542|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In285175542|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out285175542|, ~z$mem_tmp~0=~z$mem_tmp~0_Out285175542, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out285175542|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out285175542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out285175542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out285175542, ~z$flush_delayed~0=~z$flush_delayed~0_Out285175542, ~weak$$choice0~0=~weak$$choice0~0_Out285175542, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out285175542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~weak$$choice2~0=~weak$$choice2~0_Out285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 21:03:51,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In462631140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In462631140 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out462631140| |P3Thread1of1ForFork2_#t~ite28_Out462631140|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out462631140| ~z$w_buff0~0_In462631140) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z$w_buff1~0_In462631140 |P3Thread1of1ForFork2_#t~ite28_Out462631140|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out462631140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out462631140|, ~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:03:51,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:03:51,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1099231592 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z$mem_tmp~0_In1099231592)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z~0_In1099231592)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1099231592|, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:03:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 21:03:51,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:03:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In648285164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In648285164 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| ~z$w_buff0_used~0_In648285164)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out648285164|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:03:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In836502439 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z~0_In836502439) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z$mem_tmp~0_In836502439)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In836502439, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In836502439, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out836502439|, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:03:51,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-584625225 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-584625225 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-584625225 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-584625225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-584625225|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-584625225| ~z$w_buff1_used~0_In-584625225)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-584625225|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:03:51,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-553304508 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-553304508 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out-553304508 ~z$r_buff0_thd4~0_In-553304508))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out-553304508 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-553304508} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-553304508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-553304508} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:03:51,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1368005042 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1368005042 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1368005042 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1368005042 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1368005042 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1368005042|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:03:51,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:03:51,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:03:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:03:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1223133688 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1223133688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z~0_In-1223133688) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z$w_buff1~0_In-1223133688) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ~z~0=~z~0_In-1223133688} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1223133688|, ~z~0=~z~0_In-1223133688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:03:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:03:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1207521528 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1207521528 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| ~z$w_buff0_used~0_In-1207521528)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1207521528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:03:51,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In989281067 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In989281067 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In989281067 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In989281067 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out989281067| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out989281067| ~z$w_buff1_used~0_In989281067) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out989281067|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:03:51,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In44215696 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In44215696 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| ~z$r_buff0_thd0~0_In44215696)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out44215696|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:03:51,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1569247255 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1569247255 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1569247255 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1569247255 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1569247255| ~z$r_buff1_thd0~0_In1569247255)) (and (= |ULTIMATE.start_main_#t~ite64_Out1569247255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1569247255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:03:51,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:03:51,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:03:51 BasicIcfg [2019-12-07 21:03:51,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:03:51,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:03:51,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:03:51,949 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:03:51,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:00:29" (3/4) ... [2019-12-07 21:03:51,951 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:03:51,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38|) |v_ULTIMATE.start_main_~#t493~0.offset_25| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t493~0.base_38|) (= |v_ULTIMATE.start_main_~#t493~0.offset_25| 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t493~0.base_38| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_22|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t493~0.offset=|v_ULTIMATE.start_main_~#t493~0.offset_25|, ULTIMATE.start_main_~#t493~0.base=|v_ULTIMATE.start_main_~#t493~0.base_38|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_30|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_40|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t496~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t493~0.offset, ULTIMATE.start_main_~#t493~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t496~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t495~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t495~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t494~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t494~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:03:51,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t494~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t494~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t494~0.base_11|) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t494~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11|) |v_ULTIMATE.start_main_~#t494~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t494~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t494~0.offset] because there is no mapped edge [2019-12-07 21:03:51,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t495~0.offset_11|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t495~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t495~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t495~0.base_11| 4)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11| 1)) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11|) |v_ULTIMATE.start_main_~#t495~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t495~0.base, #length, ULTIMATE.start_main_~#t495~0.offset] because there is no mapped edge [2019-12-07 21:03:51,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9|) |v_ULTIMATE.start_main_~#t496~0.offset_8| 3)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t496~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t496~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t496~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t496~0.offset] because there is no mapped edge [2019-12-07 21:03:51,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542)) (= ~z$r_buff0_thd4~0_Out285175542 1) (= ~weak$$choice2~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet27_In285175542|) (= ~z$r_buff1_thd2~0_Out285175542 ~z$r_buff0_thd2~0_In285175542) (= ~z~0_In285175542 ~z$mem_tmp~0_Out285175542) (= ~z$r_buff0_thd3~0_In285175542 ~z$r_buff1_thd3~0_Out285175542) (= ~z$r_buff1_thd4~0_Out285175542 ~z$r_buff0_thd4~0_In285175542) (= ~z$r_buff0_thd1~0_In285175542 ~z$r_buff1_thd1~0_Out285175542) (= ~weak$$choice0~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet26_In285175542|) (= ~weak$$choice2~0_Out285175542 ~z$flush_delayed~0_Out285175542) (= ~z$r_buff0_thd0~0_In285175542 ~z$r_buff1_thd0~0_Out285175542)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In285175542|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In285175542|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out285175542|, ~z$mem_tmp~0=~z$mem_tmp~0_Out285175542, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out285175542|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out285175542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out285175542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out285175542, ~z$flush_delayed~0=~z$flush_delayed~0_Out285175542, ~weak$$choice0~0=~weak$$choice0~0_Out285175542, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out285175542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~weak$$choice2~0=~weak$$choice2~0_Out285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 21:03:51,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In462631140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In462631140 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out462631140| |P3Thread1of1ForFork2_#t~ite28_Out462631140|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out462631140| ~z$w_buff0~0_In462631140) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z$w_buff1~0_In462631140 |P3Thread1of1ForFork2_#t~ite28_Out462631140|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out462631140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out462631140|, ~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:03:51,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:03:51,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1099231592 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z$mem_tmp~0_In1099231592)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z~0_In1099231592)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1099231592|, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:03:51,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 21:03:51,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:03:51,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In648285164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In648285164 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| ~z$w_buff0_used~0_In648285164)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out648285164|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:03:51,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In836502439 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z~0_In836502439) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z$mem_tmp~0_In836502439)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In836502439, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In836502439, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out836502439|, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:03:51,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-584625225 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-584625225 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-584625225 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-584625225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-584625225|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-584625225| ~z$w_buff1_used~0_In-584625225)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-584625225|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:03:51,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-553304508 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-553304508 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out-553304508 ~z$r_buff0_thd4~0_In-553304508))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out-553304508 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-553304508} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-553304508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-553304508} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:03:51,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1368005042 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1368005042 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1368005042 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1368005042 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1368005042 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1368005042|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:03:51,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:03:51,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:03:51,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:03:51,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1223133688 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1223133688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z~0_In-1223133688) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z$w_buff1~0_In-1223133688) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ~z~0=~z~0_In-1223133688} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1223133688|, ~z~0=~z~0_In-1223133688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:03:51,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:03:51,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1207521528 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1207521528 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| ~z$w_buff0_used~0_In-1207521528)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1207521528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:03:51,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In989281067 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In989281067 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In989281067 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In989281067 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out989281067| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out989281067| ~z$w_buff1_used~0_In989281067) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out989281067|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:03:51,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In44215696 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In44215696 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| ~z$r_buff0_thd0~0_In44215696)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out44215696|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:03:51,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1569247255 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1569247255 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1569247255 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1569247255 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1569247255| ~z$r_buff1_thd0~0_In1569247255)) (and (= |ULTIMATE.start_main_#t~ite64_Out1569247255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1569247255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:03:51,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:03:52,028 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7bf46d4b-3629-4191-ae8a-6e37936205bd/bin/utaipan/witness.graphml [2019-12-07 21:03:52,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:03:52,029 INFO L168 Benchmark]: Toolchain (without parser) took 203373.81 ms. Allocated memory was 1.0 GB in the beginning and 10.3 GB in the end (delta: 9.3 GB). Free memory was 940.8 MB in the beginning and 7.5 GB in the end (delta: -6.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,029 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:03:52,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -121.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.67 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:03:52,030 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,030 INFO L168 Benchmark]: RCFGBuilder took 452.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.0 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,031 INFO L168 Benchmark]: TraceAbstraction took 202379.76 ms. Allocated memory was 1.1 GB in the beginning and 10.3 GB in the end (delta: 9.2 GB). Free memory was 995.0 MB in the beginning and 7.5 GB in the end (delta: -6.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,031 INFO L168 Benchmark]: Witness Printer took 79.61 ms. Allocated memory is still 10.3 GB. Free memory was 7.5 GB in the beginning and 7.5 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:03:52,032 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -121.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.67 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 28.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 452.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.0 MB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 202379.76 ms. Allocated memory was 1.1 GB in the beginning and 10.3 GB in the end (delta: 9.2 GB). Free memory was 995.0 MB in the beginning and 7.5 GB in the end (delta: -6.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 79.61 ms. Allocated memory is still 10.3 GB. Free memory was 7.5 GB in the beginning and 7.5 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t493, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t494, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t495, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t496, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 202.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5573 SDtfs, 9192 SDslu, 11775 SDs, 0 SdLazy, 3025 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433830occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 140.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 837766 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 784 ConstructedInterpolants, 0 QuantifiedInterpolants, 219666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...