./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014_power.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_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/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 bc36f6abe56a4a6aa30bcfd05e07f22825f13dcd ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:55:25,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:55:25,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:55:25,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:55:25,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:55:25,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:55:25,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:55:25,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:55:25,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:55:25,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:55:25,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:55:25,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:55:25,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:55:25,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:55:25,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:55:25,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:55:25,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:55:25,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:55:25,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:55:25,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:55:25,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:55:25,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:55:25,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:55:25,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:55:25,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:55:25,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:55:25,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:55:25,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:55:25,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:55:25,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:55:25,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:55:25,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:55:25,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:55:25,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:55:25,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:55:25,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:55:25,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:55:25,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:55:25,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:55:25,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:55:25,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:55:25,561 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:55:25,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:55:25,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:55:25,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:55:25,572 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:55:25,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:55:25,572 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:55:25,572 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:55:25,572 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:55:25,572 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:55:25,573 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:55:25,573 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:55:25,573 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:55:25,573 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:55:25,573 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:55:25,573 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:55:25,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:55:25,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:55:25,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:55:25,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:55:25,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:55:25,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:55:25,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:55:25,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:55:25,577 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_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/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 -> bc36f6abe56a4a6aa30bcfd05e07f22825f13dcd [2019-12-07 13:55:25,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:55:25,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:55:25,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:55:25,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:55:25,691 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:55:25,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix014_power.opt.i [2019-12-07 13:55:25,734 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/data/6a718f43a/4703178775a0438cbbcf04c8cf9b8d0f/FLAGf418f7795 [2019-12-07 13:55:26,200 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:55:26,200 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/sv-benchmarks/c/pthread-wmm/mix014_power.opt.i [2019-12-07 13:55:26,212 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/data/6a718f43a/4703178775a0438cbbcf04c8cf9b8d0f/FLAGf418f7795 [2019-12-07 13:55:26,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/data/6a718f43a/4703178775a0438cbbcf04c8cf9b8d0f [2019-12-07 13:55:26,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:55:26,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:55:26,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:55:26,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:55:26,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:55:26,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5fb732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26, skipping insertion in model container [2019-12-07 13:55:26,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:55:26,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:55:26,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:55:26,529 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:55:26,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:55:26,621 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:55:26,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26 WrapperNode [2019-12-07 13:55:26,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:55:26,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:55:26,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:55:26,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:55:26,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:55:26,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:55:26,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:55:26,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:55:26,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... [2019-12-07 13:55:26,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:55:26,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:55:26,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:55:26,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:55:26,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/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 13:55:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:55:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:55:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:55:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:55:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:55:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:55:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:55:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:55:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:55:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:55:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:55:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:55:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:55:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:55:26,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:55:26,745 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 13:55:27,147 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:55:27,147 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:55:27,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:55:27 BoogieIcfgContainer [2019-12-07 13:55:27,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:55:27,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:55:27,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:55:27,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:55:27,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:55:26" (1/3) ... [2019-12-07 13:55:27,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1220c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:55:27, skipping insertion in model container [2019-12-07 13:55:27,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:55:26" (2/3) ... [2019-12-07 13:55:27,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1220c8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:55:27, skipping insertion in model container [2019-12-07 13:55:27,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:55:27" (3/3) ... [2019-12-07 13:55:27,152 INFO L109 eAbstractionObserver]: Analyzing ICFG mix014_power.opt.i [2019-12-07 13:55:27,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:55:27,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:55:27,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:55:27,164 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,205 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,206 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,207 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,208 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,209 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,210 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:55:27,231 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:55:27,243 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:55:27,243 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:55:27,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:55:27,244 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:55:27,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:55:27,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:55:27,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:55:27,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:55:27,256 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 13:55:27,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:55:27,332 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:55:27,332 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:55:27,347 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:55:27,370 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 13:55:27,417 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 13:55:27,417 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:55:27,427 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 13:55:27,454 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 13:55:27,455 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:55:30,911 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 13:55:31,117 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:55:31,240 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147467 [2019-12-07 13:55:31,240 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 13:55:31,243 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 134 transitions [2019-12-07 13:55:39,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 94794 states. [2019-12-07 13:55:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 94794 states. [2019-12-07 13:55:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:55:39,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:55:39,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:55:39,815 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 13:55:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:55:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash -284739831, now seen corresponding path program 1 times [2019-12-07 13:55:39,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:55:39,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054620409] [2019-12-07 13:55:39,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:55:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:55:39,988 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 13:55:39,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054620409] [2019-12-07 13:55:39,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:55:39,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:55:39,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975778061] [2019-12-07 13:55:39,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:55:39,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:55:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:55:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:55:40,004 INFO L87 Difference]: Start difference. First operand 94794 states. Second operand 3 states. [2019-12-07 13:55:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:55:40,693 INFO L93 Difference]: Finished difference Result 94058 states and 432536 transitions. [2019-12-07 13:55:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:55:40,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:55:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:55:41,381 INFO L225 Difference]: With dead ends: 94058 [2019-12-07 13:55:41,381 INFO L226 Difference]: Without dead ends: 88038 [2019-12-07 13:55:41,382 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 13:55:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88038 states. [2019-12-07 13:55:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88038 to 88038. [2019-12-07 13:55:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88038 states. [2019-12-07 13:55:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88038 states to 88038 states and 404604 transitions. [2019-12-07 13:55:44,331 INFO L78 Accepts]: Start accepts. Automaton has 88038 states and 404604 transitions. Word has length 9 [2019-12-07 13:55:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:55:44,332 INFO L462 AbstractCegarLoop]: Abstraction has 88038 states and 404604 transitions. [2019-12-07 13:55:44,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:55:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 88038 states and 404604 transitions. [2019-12-07 13:55:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:55:44,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:55:44,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:55:44,337 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 13:55:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:55:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1938763797, now seen corresponding path program 1 times [2019-12-07 13:55:44,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:55:44,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152303421] [2019-12-07 13:55:44,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:55:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:55:44,395 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 13:55:44,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152303421] [2019-12-07 13:55:44,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:55:44,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:55:44,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101386816] [2019-12-07 13:55:44,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:55:44,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:55:44,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:55:44,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:55:44,397 INFO L87 Difference]: Start difference. First operand 88038 states and 404604 transitions. Second operand 4 states. [2019-12-07 13:55:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:55:47,096 INFO L93 Difference]: Finished difference Result 136614 states and 606732 transitions. [2019-12-07 13:55:47,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:55:47,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:55:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:55:47,539 INFO L225 Difference]: With dead ends: 136614 [2019-12-07 13:55:47,539 INFO L226 Difference]: Without dead ends: 136550 [2019-12-07 13:55:47,539 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 13:55:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136550 states. [2019-12-07 13:55:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136550 to 133014. [2019-12-07 13:55:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133014 states. [2019-12-07 13:55:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133014 states to 133014 states and 593752 transitions. [2019-12-07 13:55:51,412 INFO L78 Accepts]: Start accepts. Automaton has 133014 states and 593752 transitions. Word has length 15 [2019-12-07 13:55:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:55:51,412 INFO L462 AbstractCegarLoop]: Abstraction has 133014 states and 593752 transitions. [2019-12-07 13:55:51,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:55:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 133014 states and 593752 transitions. [2019-12-07 13:55:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:55:51,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:55:51,418 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 13:55:51,419 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 13:55:51,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:55:51,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1496935772, now seen corresponding path program 1 times [2019-12-07 13:55:51,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:55:51,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160446291] [2019-12-07 13:55:51,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:55:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:55:51,462 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 13:55:51,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160446291] [2019-12-07 13:55:51,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:55:51,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:55:51,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037388355] [2019-12-07 13:55:51,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:55:51,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:55:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:55:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:55:51,464 INFO L87 Difference]: Start difference. First operand 133014 states and 593752 transitions. Second operand 4 states. [2019-12-07 13:55:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:55:52,411 INFO L93 Difference]: Finished difference Result 173334 states and 762780 transitions. [2019-12-07 13:55:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:55:52,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:55:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:55:53,328 INFO L225 Difference]: With dead ends: 173334 [2019-12-07 13:55:53,328 INFO L226 Difference]: Without dead ends: 173274 [2019-12-07 13:55:53,328 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 13:55:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173274 states. [2019-12-07 13:55:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173274 to 154858. [2019-12-07 13:55:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154858 states. [2019-12-07 13:55:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154858 states to 154858 states and 687340 transitions. [2019-12-07 13:55:59,757 INFO L78 Accepts]: Start accepts. Automaton has 154858 states and 687340 transitions. Word has length 18 [2019-12-07 13:55:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:55:59,758 INFO L462 AbstractCegarLoop]: Abstraction has 154858 states and 687340 transitions. [2019-12-07 13:55:59,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:55:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 154858 states and 687340 transitions. [2019-12-07 13:55:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:55:59,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:55:59,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] [2019-12-07 13:55:59,771 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 13:55:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:55:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -839601205, now seen corresponding path program 1 times [2019-12-07 13:55:59,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:55:59,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747777491] [2019-12-07 13:55:59,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:55:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:55:59,807 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 13:55:59,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747777491] [2019-12-07 13:55:59,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:55:59,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:55:59,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253687443] [2019-12-07 13:55:59,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:55:59,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:55:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:55:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:55:59,809 INFO L87 Difference]: Start difference. First operand 154858 states and 687340 transitions. Second operand 3 states. [2019-12-07 13:56:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:56:01,157 INFO L93 Difference]: Finished difference Result 260150 states and 1112960 transitions. [2019-12-07 13:56:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:56:01,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:56:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:56:01,937 INFO L225 Difference]: With dead ends: 260150 [2019-12-07 13:56:01,938 INFO L226 Difference]: Without dead ends: 260150 [2019-12-07 13:56:01,938 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 13:56:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260150 states. [2019-12-07 13:56:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260150 to 230750. [2019-12-07 13:56:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230750 states. [2019-12-07 13:56:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230750 states to 230750 states and 999636 transitions. [2019-12-07 13:56:11,016 INFO L78 Accepts]: Start accepts. Automaton has 230750 states and 999636 transitions. Word has length 19 [2019-12-07 13:56:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:56:11,017 INFO L462 AbstractCegarLoop]: Abstraction has 230750 states and 999636 transitions. [2019-12-07 13:56:11,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:56:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 230750 states and 999636 transitions. [2019-12-07 13:56:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:56:11,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:56:11,030 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 13:56:11,031 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 13:56:11,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:56:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash -879634023, now seen corresponding path program 1 times [2019-12-07 13:56:11,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:56:11,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820168049] [2019-12-07 13:56:11,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:56:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:56:11,113 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 13:56:11,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820168049] [2019-12-07 13:56:11,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:56:11,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:56:11,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113094980] [2019-12-07 13:56:11,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:56:11,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:56:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:56:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:56:11,114 INFO L87 Difference]: Start difference. First operand 230750 states and 999636 transitions. Second operand 3 states. [2019-12-07 13:56:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:56:12,923 INFO L93 Difference]: Finished difference Result 305787 states and 1252521 transitions. [2019-12-07 13:56:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:56:12,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:56:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:56:13,783 INFO L225 Difference]: With dead ends: 305787 [2019-12-07 13:56:13,784 INFO L226 Difference]: Without dead ends: 305208 [2019-12-07 13:56:13,784 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 13:56:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305208 states. [2019-12-07 13:56:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305208 to 298825. [2019-12-07 13:56:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298825 states. [2019-12-07 13:56:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298825 states to 298825 states and 1234095 transitions. [2019-12-07 13:56:25,213 INFO L78 Accepts]: Start accepts. Automaton has 298825 states and 1234095 transitions. Word has length 20 [2019-12-07 13:56:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:56:25,213 INFO L462 AbstractCegarLoop]: Abstraction has 298825 states and 1234095 transitions. [2019-12-07 13:56:25,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:56:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 298825 states and 1234095 transitions. [2019-12-07 13:56:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:56:25,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:56:25,230 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 13:56:25,230 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 13:56:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:56:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2110724180, now seen corresponding path program 1 times [2019-12-07 13:56:25,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:56:25,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130629469] [2019-12-07 13:56:25,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:56:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:56:25,264 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 13:56:25,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130629469] [2019-12-07 13:56:25,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:56:25,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:56:25,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524866856] [2019-12-07 13:56:25,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:56:25,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:56:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:56:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:56:25,266 INFO L87 Difference]: Start difference. First operand 298825 states and 1234095 transitions. Second operand 3 states. [2019-12-07 13:56:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:56:26,550 INFO L93 Difference]: Finished difference Result 281536 states and 1147465 transitions. [2019-12-07 13:56:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:56:26,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 13:56:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:56:27,327 INFO L225 Difference]: With dead ends: 281536 [2019-12-07 13:56:27,327 INFO L226 Difference]: Without dead ends: 281536 [2019-12-07 13:56:27,327 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 13:56:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281536 states. [2019-12-07 13:56:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281536 to 278728. [2019-12-07 13:56:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278728 states. [2019-12-07 13:56:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278728 states to 278728 states and 1137145 transitions. [2019-12-07 13:56:37,613 INFO L78 Accepts]: Start accepts. Automaton has 278728 states and 1137145 transitions. Word has length 21 [2019-12-07 13:56:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:56:37,613 INFO L462 AbstractCegarLoop]: Abstraction has 278728 states and 1137145 transitions. [2019-12-07 13:56:37,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:56:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 278728 states and 1137145 transitions. [2019-12-07 13:56:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:56:37,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:56:37,626 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 13:56:37,626 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 13:56:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:56:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1163306403, now seen corresponding path program 1 times [2019-12-07 13:56:37,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:56:37,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354107356] [2019-12-07 13:56:37,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:56:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:56:37,679 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 13:56:37,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354107356] [2019-12-07 13:56:37,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:56:37,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:56:37,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764409] [2019-12-07 13:56:37,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:56:37,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:56:37,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:56:37,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:56:37,681 INFO L87 Difference]: Start difference. First operand 278728 states and 1137145 transitions. Second operand 4 states. [2019-12-07 13:56:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:56:39,341 INFO L93 Difference]: Finished difference Result 274918 states and 1118388 transitions. [2019-12-07 13:56:39,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:56:39,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:56:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:56:40,095 INFO L225 Difference]: With dead ends: 274918 [2019-12-07 13:56:40,095 INFO L226 Difference]: Without dead ends: 274918 [2019-12-07 13:56:40,096 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 13:56:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274918 states. [2019-12-07 13:56:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274918 to 234676. [2019-12-07 13:56:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234676 states. [2019-12-07 13:56:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234676 states to 234676 states and 983534 transitions. [2019-12-07 13:56:47,054 INFO L78 Accepts]: Start accepts. Automaton has 234676 states and 983534 transitions. Word has length 21 [2019-12-07 13:56:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:56:47,054 INFO L462 AbstractCegarLoop]: Abstraction has 234676 states and 983534 transitions. [2019-12-07 13:56:47,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:56:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 234676 states and 983534 transitions. [2019-12-07 13:56:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:56:47,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:56:47,067 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 13:56:47,067 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 13:56:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:56:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 49865209, now seen corresponding path program 1 times [2019-12-07 13:56:47,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:56:47,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316433225] [2019-12-07 13:56:47,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:56:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:56:47,093 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 13:56:47,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316433225] [2019-12-07 13:56:47,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:56:47,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:56:47,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346467863] [2019-12-07 13:56:47,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:56:47,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:56:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:56:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:56:47,095 INFO L87 Difference]: Start difference. First operand 234676 states and 983534 transitions. Second operand 4 states. [2019-12-07 13:56:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:56:48,654 INFO L93 Difference]: Finished difference Result 292169 states and 1212791 transitions. [2019-12-07 13:56:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:56:48,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:56:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:56:52,291 INFO L225 Difference]: With dead ends: 292169 [2019-12-07 13:56:52,291 INFO L226 Difference]: Without dead ends: 292101 [2019-12-07 13:56:52,291 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 13:56:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292101 states. [2019-12-07 13:56:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292101 to 238074. [2019-12-07 13:56:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238074 states. [2019-12-07 13:56:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238074 states to 238074 states and 997549 transitions. [2019-12-07 13:56:58,777 INFO L78 Accepts]: Start accepts. Automaton has 238074 states and 997549 transitions. Word has length 21 [2019-12-07 13:56:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:56:58,777 INFO L462 AbstractCegarLoop]: Abstraction has 238074 states and 997549 transitions. [2019-12-07 13:56:58,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:56:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 238074 states and 997549 transitions. [2019-12-07 13:56:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:56:58,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:56:58,806 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 13:56:58,806 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 13:56:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:56:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2022495742, now seen corresponding path program 1 times [2019-12-07 13:56:58,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:56:58,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384525888] [2019-12-07 13:56:58,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:56:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:56:58,838 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 13:56:58,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384525888] [2019-12-07 13:56:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:56:58,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:56:58,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990134199] [2019-12-07 13:56:58,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:56:58,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:56:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:56:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:56:58,840 INFO L87 Difference]: Start difference. First operand 238074 states and 997549 transitions. Second operand 5 states. [2019-12-07 13:57:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:01,136 INFO L93 Difference]: Finished difference Result 341553 states and 1406372 transitions. [2019-12-07 13:57:01,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:57:01,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 13:57:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:02,109 INFO L225 Difference]: With dead ends: 341553 [2019-12-07 13:57:02,109 INFO L226 Difference]: Without dead ends: 341497 [2019-12-07 13:57:02,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 13:57:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341497 states. [2019-12-07 13:57:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341497 to 257509. [2019-12-07 13:57:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257509 states. [2019-12-07 13:57:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257509 states to 257509 states and 1077041 transitions. [2019-12-07 13:57:10,385 INFO L78 Accepts]: Start accepts. Automaton has 257509 states and 1077041 transitions. Word has length 24 [2019-12-07 13:57:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:10,385 INFO L462 AbstractCegarLoop]: Abstraction has 257509 states and 1077041 transitions. [2019-12-07 13:57:10,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:57:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 257509 states and 1077041 transitions. [2019-12-07 13:57:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:57:10,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:10,443 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 13:57:10,443 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 13:57:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash -144970163, now seen corresponding path program 1 times [2019-12-07 13:57:10,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:10,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756126685] [2019-12-07 13:57:10,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:10,470 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 13:57:10,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756126685] [2019-12-07 13:57:10,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:10,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:57:10,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022192538] [2019-12-07 13:57:10,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:57:10,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:57:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:57:10,471 INFO L87 Difference]: Start difference. First operand 257509 states and 1077041 transitions. Second operand 3 states. [2019-12-07 13:57:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:11,385 INFO L93 Difference]: Finished difference Result 205101 states and 798599 transitions. [2019-12-07 13:57:11,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:57:11,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 13:57:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:11,923 INFO L225 Difference]: With dead ends: 205101 [2019-12-07 13:57:11,923 INFO L226 Difference]: Without dead ends: 205101 [2019-12-07 13:57:11,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:57:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205101 states. [2019-12-07 13:57:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205101 to 205101. [2019-12-07 13:57:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205101 states. [2019-12-07 13:57:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205101 states to 205101 states and 798599 transitions. [2019-12-07 13:57:19,335 INFO L78 Accepts]: Start accepts. Automaton has 205101 states and 798599 transitions. Word has length 27 [2019-12-07 13:57:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:19,335 INFO L462 AbstractCegarLoop]: Abstraction has 205101 states and 798599 transitions. [2019-12-07 13:57:19,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:57:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 205101 states and 798599 transitions. [2019-12-07 13:57:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:57:19,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:19,376 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] [2019-12-07 13:57:19,376 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 13:57:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1370458192, now seen corresponding path program 1 times [2019-12-07 13:57:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:19,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423127360] [2019-12-07 13:57:19,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:19,409 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 13:57:19,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423127360] [2019-12-07 13:57:19,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:19,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:19,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100579510] [2019-12-07 13:57:19,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:57:19,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:19,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:57:19,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:57:19,411 INFO L87 Difference]: Start difference. First operand 205101 states and 798599 transitions. Second operand 4 states. [2019-12-07 13:57:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:19,702 INFO L93 Difference]: Finished difference Result 89057 states and 294437 transitions. [2019-12-07 13:57:19,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:57:19,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 13:57:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:19,851 INFO L225 Difference]: With dead ends: 89057 [2019-12-07 13:57:19,851 INFO L226 Difference]: Without dead ends: 89057 [2019-12-07 13:57:19,852 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 13:57:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89057 states. [2019-12-07 13:57:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89057 to 88857. [2019-12-07 13:57:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88857 states. [2019-12-07 13:57:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88857 states to 88857 states and 293791 transitions. [2019-12-07 13:57:21,744 INFO L78 Accepts]: Start accepts. Automaton has 88857 states and 293791 transitions. Word has length 28 [2019-12-07 13:57:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:21,744 INFO L462 AbstractCegarLoop]: Abstraction has 88857 states and 293791 transitions. [2019-12-07 13:57:21,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:57:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 88857 states and 293791 transitions. [2019-12-07 13:57:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:57:21,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:21,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:57:21,761 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 13:57:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1918625833, now seen corresponding path program 1 times [2019-12-07 13:57:21,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:21,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678607352] [2019-12-07 13:57:21,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:21,795 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 13:57:21,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678607352] [2019-12-07 13:57:21,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:21,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:57:21,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585909984] [2019-12-07 13:57:21,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:57:21,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:57:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:57:21,796 INFO L87 Difference]: Start difference. First operand 88857 states and 293791 transitions. Second operand 5 states. [2019-12-07 13:57:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:21,876 INFO L93 Difference]: Finished difference Result 22025 states and 68715 transitions. [2019-12-07 13:57:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:57:21,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 13:57:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:21,902 INFO L225 Difference]: With dead ends: 22025 [2019-12-07 13:57:21,902 INFO L226 Difference]: Without dead ends: 22025 [2019-12-07 13:57:21,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:57:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22025 states. [2019-12-07 13:57:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22025 to 20618. [2019-12-07 13:57:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20618 states. [2019-12-07 13:57:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20618 states to 20618 states and 64365 transitions. [2019-12-07 13:57:22,160 INFO L78 Accepts]: Start accepts. Automaton has 20618 states and 64365 transitions. Word has length 29 [2019-12-07 13:57:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:22,160 INFO L462 AbstractCegarLoop]: Abstraction has 20618 states and 64365 transitions. [2019-12-07 13:57:22,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:57:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 20618 states and 64365 transitions. [2019-12-07 13:57:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:57:22,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:22,173 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 13:57:22,173 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 13:57:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash -289187602, now seen corresponding path program 1 times [2019-12-07 13:57:22,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:22,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828626169] [2019-12-07 13:57:22,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:22,196 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 13:57:22,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828626169] [2019-12-07 13:57:22,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:22,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:22,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667037512] [2019-12-07 13:57:22,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:57:22,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:57:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:57:22,197 INFO L87 Difference]: Start difference. First operand 20618 states and 64365 transitions. Second operand 3 states. [2019-12-07 13:57:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:22,290 INFO L93 Difference]: Finished difference Result 21890 states and 64641 transitions. [2019-12-07 13:57:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:57:22,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 13:57:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:22,316 INFO L225 Difference]: With dead ends: 21890 [2019-12-07 13:57:22,316 INFO L226 Difference]: Without dead ends: 21890 [2019-12-07 13:57:22,317 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 13:57:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21890 states. [2019-12-07 13:57:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21890 to 20699. [2019-12-07 13:57:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20699 states. [2019-12-07 13:57:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20699 states to 20699 states and 61668 transitions. [2019-12-07 13:57:22,884 INFO L78 Accepts]: Start accepts. Automaton has 20699 states and 61668 transitions. Word has length 37 [2019-12-07 13:57:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:22,884 INFO L462 AbstractCegarLoop]: Abstraction has 20699 states and 61668 transitions. [2019-12-07 13:57:22,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:57:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 20699 states and 61668 transitions. [2019-12-07 13:57:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:57:22,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:22,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:57:22,898 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 13:57:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1741884328, now seen corresponding path program 1 times [2019-12-07 13:57:22,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:22,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123575005] [2019-12-07 13:57:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:22,935 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 13:57:22,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123575005] [2019-12-07 13:57:22,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:22,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:22,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708572657] [2019-12-07 13:57:22,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:57:22,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:57:22,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:57:22,936 INFO L87 Difference]: Start difference. First operand 20699 states and 61668 transitions. Second operand 5 states. [2019-12-07 13:57:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:23,217 INFO L93 Difference]: Finished difference Result 22817 states and 66646 transitions. [2019-12-07 13:57:23,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:57:23,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 13:57:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:23,243 INFO L225 Difference]: With dead ends: 22817 [2019-12-07 13:57:23,243 INFO L226 Difference]: Without dead ends: 22816 [2019-12-07 13:57:23,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:57:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22816 states. [2019-12-07 13:57:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22816 to 18474. [2019-12-07 13:57:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18474 states. [2019-12-07 13:57:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18474 states to 18474 states and 55407 transitions. [2019-12-07 13:57:23,496 INFO L78 Accepts]: Start accepts. Automaton has 18474 states and 55407 transitions. Word has length 40 [2019-12-07 13:57:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:23,497 INFO L462 AbstractCegarLoop]: Abstraction has 18474 states and 55407 transitions. [2019-12-07 13:57:23,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:57:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18474 states and 55407 transitions. [2019-12-07 13:57:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:57:23,512 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:23,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:23,512 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 13:57:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1340023861, now seen corresponding path program 1 times [2019-12-07 13:57:23,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:23,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757159653] [2019-12-07 13:57:23,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:23,555 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 13:57:23,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757159653] [2019-12-07 13:57:23,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:23,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:57:23,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215237148] [2019-12-07 13:57:23,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:57:23,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:23,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:57:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:57:23,557 INFO L87 Difference]: Start difference. First operand 18474 states and 55407 transitions. Second operand 6 states. [2019-12-07 13:57:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:23,624 INFO L93 Difference]: Finished difference Result 15361 states and 48687 transitions. [2019-12-07 13:57:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:57:23,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:57:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:23,643 INFO L225 Difference]: With dead ends: 15361 [2019-12-07 13:57:23,643 INFO L226 Difference]: Without dead ends: 15322 [2019-12-07 13:57:23,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:57:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15322 states. [2019-12-07 13:57:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15322 to 14007. [2019-12-07 13:57:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14007 states. [2019-12-07 13:57:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14007 states to 14007 states and 45422 transitions. [2019-12-07 13:57:23,835 INFO L78 Accepts]: Start accepts. Automaton has 14007 states and 45422 transitions. Word has length 48 [2019-12-07 13:57:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:23,835 INFO L462 AbstractCegarLoop]: Abstraction has 14007 states and 45422 transitions. [2019-12-07 13:57:23,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:57:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 14007 states and 45422 transitions. [2019-12-07 13:57:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:57:23,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:23,849 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 13:57:23,849 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 13:57:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash 845814509, now seen corresponding path program 1 times [2019-12-07 13:57:23,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:23,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910516385] [2019-12-07 13:57:23,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:23,916 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 13:57:23,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910516385] [2019-12-07 13:57:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:23,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:23,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887835828] [2019-12-07 13:57:23,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:57:23,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:57:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:57:23,917 INFO L87 Difference]: Start difference. First operand 14007 states and 45422 transitions. Second operand 4 states. [2019-12-07 13:57:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:23,989 INFO L93 Difference]: Finished difference Result 18022 states and 54774 transitions. [2019-12-07 13:57:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:57:23,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:57:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:24,010 INFO L225 Difference]: With dead ends: 18022 [2019-12-07 13:57:24,010 INFO L226 Difference]: Without dead ends: 17090 [2019-12-07 13:57:24,010 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 13:57:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17090 states. [2019-12-07 13:57:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17090 to 13419. [2019-12-07 13:57:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13419 states. [2019-12-07 13:57:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13419 states to 13419 states and 43186 transitions. [2019-12-07 13:57:24,202 INFO L78 Accepts]: Start accepts. Automaton has 13419 states and 43186 transitions. Word has length 65 [2019-12-07 13:57:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:24,203 INFO L462 AbstractCegarLoop]: Abstraction has 13419 states and 43186 transitions. [2019-12-07 13:57:24,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:57:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13419 states and 43186 transitions. [2019-12-07 13:57:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:57:24,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:24,216 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 13:57:24,216 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 13:57:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash 936797461, now seen corresponding path program 2 times [2019-12-07 13:57:24,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:24,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967876806] [2019-12-07 13:57:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:24,294 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 13:57:24,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967876806] [2019-12-07 13:57:24,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:24,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:57:24,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950072213] [2019-12-07 13:57:24,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:57:24,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:57:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:57:24,295 INFO L87 Difference]: Start difference. First operand 13419 states and 43186 transitions. Second operand 7 states. [2019-12-07 13:57:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:24,536 INFO L93 Difference]: Finished difference Result 34170 states and 107967 transitions. [2019-12-07 13:57:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:57:24,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 13:57:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:24,565 INFO L225 Difference]: With dead ends: 34170 [2019-12-07 13:57:24,566 INFO L226 Difference]: Without dead ends: 24026 [2019-12-07 13:57:24,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:57:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24026 states. [2019-12-07 13:57:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24026 to 18135. [2019-12-07 13:57:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18135 states. [2019-12-07 13:57:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18135 states to 18135 states and 56744 transitions. [2019-12-07 13:57:24,838 INFO L78 Accepts]: Start accepts. Automaton has 18135 states and 56744 transitions. Word has length 65 [2019-12-07 13:57:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:24,839 INFO L462 AbstractCegarLoop]: Abstraction has 18135 states and 56744 transitions. [2019-12-07 13:57:24,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:57:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 18135 states and 56744 transitions. [2019-12-07 13:57:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:57:24,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:24,856 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 13:57:24,856 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 13:57:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1890548017, now seen corresponding path program 3 times [2019-12-07 13:57:24,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:24,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393171194] [2019-12-07 13:57:24,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:24,960 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 13:57:24,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393171194] [2019-12-07 13:57:24,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:24,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:57:24,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003008026] [2019-12-07 13:57:24,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:57:24,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:24,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:57:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:57:24,961 INFO L87 Difference]: Start difference. First operand 18135 states and 56744 transitions. Second operand 5 states. [2019-12-07 13:57:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:25,045 INFO L93 Difference]: Finished difference Result 24103 states and 70870 transitions. [2019-12-07 13:57:25,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:57:25,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 13:57:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:25,059 INFO L225 Difference]: With dead ends: 24103 [2019-12-07 13:57:25,059 INFO L226 Difference]: Without dead ends: 11860 [2019-12-07 13:57:25,060 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 13:57:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2019-12-07 13:57:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 10925. [2019-12-07 13:57:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-07 13:57:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 30574 transitions. [2019-12-07 13:57:25,191 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 30574 transitions. Word has length 65 [2019-12-07 13:57:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:25,191 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 30574 transitions. [2019-12-07 13:57:25,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:57:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 30574 transitions. [2019-12-07 13:57:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 13:57:25,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:25,200 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 13:57:25,200 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 13:57:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash 85165569, now seen corresponding path program 4 times [2019-12-07 13:57:25,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:25,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491647427] [2019-12-07 13:57:25,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:25,273 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 13:57:25,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491647427] [2019-12-07 13:57:25,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:25,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:25,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215336519] [2019-12-07 13:57:25,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:57:25,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:57:25,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:57:25,275 INFO L87 Difference]: Start difference. First operand 10925 states and 30574 transitions. Second operand 4 states. [2019-12-07 13:57:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:25,350 INFO L93 Difference]: Finished difference Result 14798 states and 40063 transitions. [2019-12-07 13:57:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:57:25,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 13:57:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:25,363 INFO L225 Difference]: With dead ends: 14798 [2019-12-07 13:57:25,363 INFO L226 Difference]: Without dead ends: 12487 [2019-12-07 13:57:25,363 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 13:57:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12487 states. [2019-12-07 13:57:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12487 to 8703. [2019-12-07 13:57:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8703 states. [2019-12-07 13:57:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 25336 transitions. [2019-12-07 13:57:25,482 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 25336 transitions. Word has length 65 [2019-12-07 13:57:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:25,482 INFO L462 AbstractCegarLoop]: Abstraction has 8703 states and 25336 transitions. [2019-12-07 13:57:25,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:57:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 25336 transitions. [2019-12-07 13:57:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:57:25,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:25,489 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 13:57:25,489 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 13:57:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash -471122572, now seen corresponding path program 1 times [2019-12-07 13:57:25,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:25,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85600230] [2019-12-07 13:57:25,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:25,555 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 13:57:25,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85600230] [2019-12-07 13:57:25,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:25,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:57:25,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918737760] [2019-12-07 13:57:25,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:57:25,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:57:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:57:25,556 INFO L87 Difference]: Start difference. First operand 8703 states and 25336 transitions. Second operand 4 states. [2019-12-07 13:57:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:25,588 INFO L93 Difference]: Finished difference Result 9649 states and 27354 transitions. [2019-12-07 13:57:25,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:57:25,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 13:57:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:25,594 INFO L225 Difference]: With dead ends: 9649 [2019-12-07 13:57:25,594 INFO L226 Difference]: Without dead ends: 5275 [2019-12-07 13:57:25,595 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 13:57:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2019-12-07 13:57:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5275. [2019-12-07 13:57:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5275 states. [2019-12-07 13:57:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 13372 transitions. [2019-12-07 13:57:25,651 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 13372 transitions. Word has length 66 [2019-12-07 13:57:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:25,651 INFO L462 AbstractCegarLoop]: Abstraction has 5275 states and 13372 transitions. [2019-12-07 13:57:25,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:57:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 13372 transitions. [2019-12-07 13:57:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:57:25,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:25,655 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 13:57:25,655 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 13:57:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2114275120, now seen corresponding path program 2 times [2019-12-07 13:57:25,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:25,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575969083] [2019-12-07 13:57:25,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:25,722 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 13:57:25,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575969083] [2019-12-07 13:57:25,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:25,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:57:25,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630474548] [2019-12-07 13:57:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:57:25,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:57:25,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:57:25,723 INFO L87 Difference]: Start difference. First operand 5275 states and 13372 transitions. Second operand 5 states. [2019-12-07 13:57:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:25,773 INFO L93 Difference]: Finished difference Result 5754 states and 14391 transitions. [2019-12-07 13:57:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:57:25,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 13:57:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:25,775 INFO L225 Difference]: With dead ends: 5754 [2019-12-07 13:57:25,775 INFO L226 Difference]: Without dead ends: 563 [2019-12-07 13:57:25,775 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 13:57:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-07 13:57:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-12-07 13:57:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 13:57:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1146 transitions. [2019-12-07 13:57:25,782 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1146 transitions. Word has length 66 [2019-12-07 13:57:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:25,782 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 1146 transitions. [2019-12-07 13:57:25,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:57:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1146 transitions. [2019-12-07 13:57:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:57:25,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:25,783 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 13:57:25,783 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 13:57:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1180004840, now seen corresponding path program 3 times [2019-12-07 13:57:25,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:25,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775184803] [2019-12-07 13:57:25,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:57:25,856 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 13:57:25,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775184803] [2019-12-07 13:57:25,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:57:25,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:57:25,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434527850] [2019-12-07 13:57:25,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:57:25,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:57:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:57:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:57:25,857 INFO L87 Difference]: Start difference. First operand 563 states and 1146 transitions. Second operand 7 states. [2019-12-07 13:57:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:57:26,061 INFO L93 Difference]: Finished difference Result 1103 states and 2244 transitions. [2019-12-07 13:57:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:57:26,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 13:57:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:57:26,062 INFO L225 Difference]: With dead ends: 1103 [2019-12-07 13:57:26,062 INFO L226 Difference]: Without dead ends: 804 [2019-12-07 13:57:26,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:57:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-12-07 13:57:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 616. [2019-12-07 13:57:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-12-07 13:57:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1237 transitions. [2019-12-07 13:57:26,067 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1237 transitions. Word has length 66 [2019-12-07 13:57:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:57:26,067 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 1237 transitions. [2019-12-07 13:57:26,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:57:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1237 transitions. [2019-12-07 13:57:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:57:26,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:57:26,068 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 13:57:26,068 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 13:57:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:57:26,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1474232984, now seen corresponding path program 4 times [2019-12-07 13:57:26,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:57:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735819261] [2019-12-07 13:57:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:57:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:57:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:57:26,150 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:57:26,150 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:57:26,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44|) 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44| 1)) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t357~0.base_44|) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= 0 |v_ULTIMATE.start_main_~#t357~0.offset_28|) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t357~0.base_44| 4)) (= v_~z$w_buff1_used~0_682 0) (= v_~y~0_58 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44|) |v_ULTIMATE.start_main_~#t357~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ULTIMATE.start_main_~#t357~0.offset=|v_ULTIMATE.start_main_~#t357~0.offset_28|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_18|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t357~0.base=|v_ULTIMATE.start_main_~#t357~0.base_44|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_36|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t357~0.offset, ULTIMATE.start_main_~#t359~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, 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_~#t358~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_~#t360~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t357~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~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_~#t359~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t358~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:57:26,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t358~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t358~0.base_11| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11|) |v_ULTIMATE.start_main_~#t358~0.offset_10| 1)) |v_#memory_int_21|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t358~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t358~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t358~0.base] because there is no mapped edge [2019-12-07 13:57:26,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12| 1) |v_#valid_46|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t359~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t359~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t359~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t359~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12|) |v_ULTIMATE.start_main_~#t359~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_12|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_11|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t359~0.base, ULTIMATE.start_main_~#t359~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 13:57:26,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_ULTIMATE.start_main_~#t360~0.offset_11| 0) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t360~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t360~0.base_13| 0)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t360~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13|) |v_ULTIMATE.start_main_~#t360~0.offset_11| 3)) |v_#memory_int_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t360~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:57:26,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:57:26,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In59456868 256))) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out59456868| |P3Thread1of1ForFork2_#t~ite28_Out59456868|)) (.cse1 (= (mod ~z$w_buff0_used~0_In59456868 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In59456868 |P3Thread1of1ForFork2_#t~ite28_Out59456868|) (or .cse1 .cse2)) (and (not .cse2) (= ~z$w_buff0~0_In59456868 |P3Thread1of1ForFork2_#t~ite28_Out59456868|) .cse0 (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In59456868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In59456868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In59456868, ~z$w_buff1~0=~z$w_buff1~0_In59456868} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out59456868|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out59456868|, ~z$w_buff0~0=~z$w_buff0~0_In59456868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In59456868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In59456868, ~z$w_buff1~0=~z$w_buff1~0_In59456868} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:57:26,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, 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_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} 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 13:57:26,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1877763172 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1877763172| ~z$mem_tmp~0_In-1877763172) (not .cse0)) (and (= ~z~0_In-1877763172 |P3Thread1of1ForFork2_#t~ite48_Out-1877763172|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1877763172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1877763172, ~z~0=~z~0_In-1877763172} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1877763172, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1877763172|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1877763172, ~z~0=~z~0_In-1877763172} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:57:26,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} 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 13:57:26,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, 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 13:57:26,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In420705777 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out420705777| ~z~0_In420705777)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out420705777| ~z$mem_tmp~0_In420705777) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In420705777, ~z$flush_delayed~0=~z$flush_delayed~0_In420705777, ~z~0=~z~0_In420705777} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In420705777, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out420705777|, ~z$flush_delayed~0=~z$flush_delayed~0_In420705777, ~z~0=~z~0_In420705777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:57:26,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In699682975 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In699682975 256) 0))) (or (and (= ~z$w_buff0_used~0_In699682975 |P3Thread1of1ForFork2_#t~ite51_Out699682975|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out699682975| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In699682975, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In699682975} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out699682975|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699682975, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In699682975} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:57:26,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In306488716 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In306488716 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In306488716 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In306488716 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out306488716| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In306488716 |P3Thread1of1ForFork2_#t~ite52_Out306488716|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In306488716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306488716, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In306488716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306488716} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out306488716|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In306488716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306488716, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In306488716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306488716} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:57:26,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1849910433 ~z$r_buff0_thd4~0_In-1849910433)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1849910433 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1849910433 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out-1849910433 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849910433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1849910433} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1849910433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849910433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1849910433} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:57:26,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-883351176 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-883351176 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-883351176 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-883351176 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-883351176|)) (and (= ~z$r_buff1_thd4~0_In-883351176 |P3Thread1of1ForFork2_#t~ite54_Out-883351176|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-883351176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883351176, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-883351176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883351176} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-883351176|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-883351176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883351176, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-883351176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883351176} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:57:26,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} 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 13:57:26,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, 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 13:57:26,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:57:26,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-532640845 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-532640845 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-532640845 |ULTIMATE.start_main_#t~ite59_Out-532640845|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-532640845| ~z~0_In-532640845) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-532640845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532640845, ~z$w_buff1~0=~z$w_buff1~0_In-532640845, ~z~0=~z~0_In-532640845} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-532640845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532640845, ~z$w_buff1~0=~z$w_buff1~0_In-532640845, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-532640845|, ~z~0=~z~0_In-532640845} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:57:26,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 13:57:26,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1879432741 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1879432741 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1879432741 |ULTIMATE.start_main_#t~ite61_Out1879432741|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1879432741|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1879432741, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1879432741} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1879432741, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1879432741|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1879432741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:57:26,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1944399166 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1944399166 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1944399166 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1944399166 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1944399166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1944399166 |ULTIMATE.start_main_#t~ite62_Out-1944399166|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1944399166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944399166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1944399166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1944399166} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1944399166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1944399166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944399166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1944399166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1944399166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:57:26,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1478613316 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1478613316 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1478613316 |ULTIMATE.start_main_#t~ite63_Out-1478613316|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1478613316| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478613316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478613316} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1478613316|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478613316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478613316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:57:26,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-718636733 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-718636733 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-718636733 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-718636733 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-718636733| ~z$r_buff1_thd0~0_In-718636733) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-718636733|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-718636733, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718636733, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-718636733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718636733} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-718636733, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718636733, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-718636733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718636733, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-718636733|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:57:26,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 13:57:26,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:57:26 BasicIcfg [2019-12-07 13:57:26,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:57:26,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:57:26,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:57:26,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:57:26,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:55:27" (3/4) ... [2019-12-07 13:57:26,255 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:57:26,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= v_~weak$$choice2~0_289 0) (= v_~z$r_buff0_thd0~0_178 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44|) 0) (= |v_#valid_90| (store .cse0 |v_ULTIMATE.start_main_~#t357~0.base_44| 1)) (= 0 v_~z$r_buff1_thd3~0_386) (= v_~z~0_311 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_71) (= v_~__unbuffered_cnt~0_176 0) (= v_~main$tmp_guard0~0_25 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff0_thd2~0_95 0) (= v_~z$read_delayed_var~0.base_5 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t357~0.base_44|) (= v_~__unbuffered_p1_EBX~0_70 0) (= 0 v_~z$mem_tmp~0_209) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~z$r_buff1_thd1~0_163 0) (= v_~z$w_buff0~0_362 0) (= 0 v_~z$r_buff0_thd4~0_531) (= v_~z$r_buff0_thd1~0_95 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_196) (= 0 v_~z$flush_delayed~0_243) (= 0 v_~__unbuffered_p3_EBX~0_64) (= v_~z$w_buff0_used~0_937 0) (= 0 v_~__unbuffered_p2_EAX~0_86) (= v_~z$r_buff1_thd2~0_163 0) (= 0 |v_ULTIMATE.start_main_~#t357~0.offset_28|) (= v_~z$w_buff1~0_247 0) (= 0 v_~z$r_buff0_thd3~0_403) (= v_~a~0_42 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t357~0.base_44| 4)) (= v_~z$w_buff1_used~0_682 0) (= v_~y~0_58 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t357~0.base_44|) |v_ULTIMATE.start_main_~#t357~0.offset_28| 0)) |v_#memory_int_29|) (= v_~z$r_buff1_thd0~0_268 0) (= v_~main$tmp_guard1~0_55 0) (= 0 v_~z$r_buff1_thd4~0_339) (= v_~x~0_88 0) (= 0 v_~__unbuffered_p3_EAX~0_71))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_163, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_114|, ~a~0=v_~a~0_42, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_178, ULTIMATE.start_main_~#t357~0.offset=|v_ULTIMATE.start_main_~#t357~0.offset_28|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_71, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_531, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~z$mem_tmp~0=v_~z$mem_tmp~0_209, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_682, ~z$flush_delayed~0=v_~z$flush_delayed~0_243, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_196, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_202|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_403, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_176, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_24|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_339, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_247, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_55, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_18|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_268, ULTIMATE.start_main_~#t357~0.base=|v_ULTIMATE.start_main_~#t357~0.base_44|, ~y~0=v_~y~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_937, ~z$w_buff0~0=v_~z$w_buff0~0_362, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_386, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_64, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_84|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_106|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_36|, ~z~0=v_~z~0_311, ~weak$$choice2~0=v_~weak$$choice2~0_289, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_95} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t357~0.offset, ULTIMATE.start_main_~#t359~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, 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_~#t358~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_~#t360~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t357~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~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_~#t359~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t358~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:57:26,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L856-1-->L858: Formula: (and (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t358~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t358~0.base_11| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t358~0.base_11|) |v_ULTIMATE.start_main_~#t358~0.offset_10| 1)) |v_#memory_int_21|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t358~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t358~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t358~0.offset=|v_ULTIMATE.start_main_~#t358~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t358~0.base=|v_ULTIMATE.start_main_~#t358~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t358~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t358~0.base] because there is no mapped edge [2019-12-07 13:57:26,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12| 1) |v_#valid_46|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t359~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t359~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t359~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t359~0.base_12|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t359~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t359~0.base_12|) |v_ULTIMATE.start_main_~#t359~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t359~0.base=|v_ULTIMATE.start_main_~#t359~0.base_12|, ULTIMATE.start_main_~#t359~0.offset=|v_ULTIMATE.start_main_~#t359~0.offset_11|, #valid=|v_#valid_46|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t359~0.base, ULTIMATE.start_main_~#t359~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 13:57:26,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L860-1-->L862: Formula: (and (= |v_ULTIMATE.start_main_~#t360~0.offset_11| 0) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t360~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t360~0.base_13| 0)) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t360~0.base_13|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t360~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t360~0.base_13|) |v_ULTIMATE.start_main_~#t360~0.offset_11| 3)) |v_#memory_int_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t360~0.offset=|v_ULTIMATE.start_main_~#t360~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t360~0.base=|v_ULTIMATE.start_main_~#t360~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t360~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t360~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:57:26,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 0)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_6| v_P3Thread1of1ForFork2_~arg.offset_4) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_90 1) (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_19) (= v_~z$w_buff0_used~0_91 v_~z$w_buff1_used~0_52) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_90 256))) (not (= 0 (mod v_~z$w_buff1_used~0_52 256))))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= v_P3Thread1of1ForFork2_~arg.base_4 |v_P3Thread1of1ForFork2_#in~arg.base_6|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_6, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_4, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_52, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_6|, ~z$w_buff1~0=v_~z$w_buff1~0_19, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_4, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 13:57:26,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L818-2-->L818-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In59456868 256))) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out59456868| |P3Thread1of1ForFork2_#t~ite28_Out59456868|)) (.cse1 (= (mod ~z$w_buff0_used~0_In59456868 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In59456868 |P3Thread1of1ForFork2_#t~ite28_Out59456868|) (or .cse1 .cse2)) (and (not .cse2) (= ~z$w_buff0~0_In59456868 |P3Thread1of1ForFork2_#t~ite28_Out59456868|) .cse0 (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In59456868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In59456868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In59456868, ~z$w_buff1~0=~z$w_buff1~0_In59456868} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out59456868|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out59456868|, ~z$w_buff0~0=~z$w_buff0~0_In59456868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In59456868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In59456868, ~z$w_buff1~0=~z$w_buff1~0_In59456868} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:57:26,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_102 v_~z$r_buff0_thd4~0_101) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, 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_101, ~weak$$choice2~0=v_~weak$$choice2~0_68} 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 13:57:26,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1877763172 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1877763172| ~z$mem_tmp~0_In-1877763172) (not .cse0)) (and (= ~z~0_In-1877763172 |P3Thread1of1ForFork2_#t~ite48_Out-1877763172|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1877763172, ~z$flush_delayed~0=~z$flush_delayed~0_In-1877763172, ~z~0=~z~0_In-1877763172} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1877763172, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1877763172|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1877763172, ~z~0=~z~0_In-1877763172} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 13:57:26,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~a~0_15 1) (= v_~x~0_24 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_24} 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 13:57:26,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~__unbuffered_p1_EBX~0_22 v_~y~0_39) (= v_~x~0_28 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= v_~x~0_28 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~y~0=v_~y~0_39} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, 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 13:57:26,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In420705777 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out420705777| ~z~0_In420705777)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out420705777| ~z$mem_tmp~0_In420705777) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In420705777, ~z$flush_delayed~0=~z$flush_delayed~0_In420705777, ~z~0=~z~0_In420705777} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In420705777, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out420705777|, ~z$flush_delayed~0=~z$flush_delayed~0_In420705777, ~z~0=~z~0_In420705777} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:57:26,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In699682975 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In699682975 256) 0))) (or (and (= ~z$w_buff0_used~0_In699682975 |P3Thread1of1ForFork2_#t~ite51_Out699682975|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out699682975| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In699682975, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In699682975} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out699682975|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699682975, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In699682975} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 13:57:26,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In306488716 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In306488716 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In306488716 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In306488716 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite52_Out306488716| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In306488716 |P3Thread1of1ForFork2_#t~ite52_Out306488716|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In306488716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306488716, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In306488716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306488716} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out306488716|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In306488716, ~z$w_buff0_used~0=~z$w_buff0_used~0_In306488716, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In306488716, ~z$w_buff1_used~0=~z$w_buff1_used~0_In306488716} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 13:57:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1849910433 ~z$r_buff0_thd4~0_In-1849910433)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1849910433 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1849910433 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out-1849910433 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849910433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1849910433} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1849910433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1849910433, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1849910433} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 13:57:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-883351176 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-883351176 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-883351176 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-883351176 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-883351176|)) (and (= ~z$r_buff1_thd4~0_In-883351176 |P3Thread1of1ForFork2_#t~ite54_Out-883351176|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-883351176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883351176, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-883351176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883351176} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-883351176|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-883351176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-883351176, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-883351176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-883351176} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 13:57:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L837-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P3Thread1of1ForFork2_#t~ite54_42| v_~z$r_buff1_thd4~0_264) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_41|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_264, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} 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 13:57:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_182) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~z~0_183 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_182, ~z~0=v_~z~0_183, 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 13:57:26,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L862-1-->L868: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_26) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:57:26,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L868-2-->L868-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-532640845 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-532640845 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-532640845 |ULTIMATE.start_main_#t~ite59_Out-532640845|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-532640845| ~z~0_In-532640845) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-532640845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532640845, ~z$w_buff1~0=~z$w_buff1~0_In-532640845, ~z~0=~z~0_In-532640845} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-532640845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-532640845, ~z$w_buff1~0=~z$w_buff1~0_In-532640845, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-532640845|, ~z~0=~z~0_In-532640845} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:57:26,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L868-4-->L869: Formula: (= v_~z~0_104 |v_ULTIMATE.start_main_#t~ite59_32|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_32|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_25|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_31|, ~z~0=v_~z~0_104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 13:57:26,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1879432741 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1879432741 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1879432741 |ULTIMATE.start_main_#t~ite61_Out1879432741|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1879432741|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1879432741, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1879432741} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1879432741, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1879432741|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1879432741} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:57:26,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L870-->L870-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1944399166 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1944399166 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1944399166 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1944399166 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1944399166| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1944399166 |ULTIMATE.start_main_#t~ite62_Out-1944399166|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1944399166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944399166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1944399166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1944399166} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1944399166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1944399166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1944399166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1944399166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1944399166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:57:26,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1478613316 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1478613316 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1478613316 |ULTIMATE.start_main_#t~ite63_Out-1478613316|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1478613316| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478613316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478613316} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1478613316|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478613316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478613316} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:57:26,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-718636733 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-718636733 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-718636733 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-718636733 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-718636733| ~z$r_buff1_thd0~0_In-718636733) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-718636733|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-718636733, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718636733, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-718636733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718636733} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-718636733, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-718636733, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-718636733, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-718636733, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-718636733|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:57:26,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_33) (= v_~x~0_44 2) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 1 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p3_EBX~0_28))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_21 256)) (= v_~z$r_buff1_thd0~0_227 |v_ULTIMATE.start_main_#t~ite64_49|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_49|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~x~0=v_~x~0_44, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_48|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 13:57:26,344 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ad2761f0-2772-40e9-9d13-7faf7dd5a7c3/bin/utaipan/witness.graphml [2019-12-07 13:57:26,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:57:26,345 INFO L168 Benchmark]: Toolchain (without parser) took 120120.74 ms. Allocated memory was 1.0 GB in the beginning and 8.8 GB in the end (delta: 7.8 GB). Free memory was 942.5 MB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,345 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:57:26,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:57:26,346 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,346 INFO L168 Benchmark]: RCFGBuilder took 455.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,347 INFO L168 Benchmark]: TraceAbstraction took 119104.48 ms. Allocated memory was 1.2 GB in the beginning and 8.8 GB in the end (delta: 7.6 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,347 INFO L168 Benchmark]: Witness Printer took 90.68 ms. Allocated memory is still 8.8 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:57:26,348 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119104.48 ms. Allocated memory was 1.2 GB in the beginning and 8.8 GB in the end (delta: 7.6 GB). Free memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: -4.3 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 90.68 ms. Allocated memory is still 8.8 GB. Free memory was 5.3 GB in the beginning and 5.3 GB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 212 ProgramPointsBefore, 114 ProgramPointsAfterwards, 255 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11004 VarBasedMoverChecksPositive, 332 VarBasedMoverChecksNegative, 88 SemBasedMoverChecksPositive, 353 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 147467 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L858] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L860] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L862] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, 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] [L818] 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_p1_EBX=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=2, 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] [L818] 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) [L819] 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_p1_EBX=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=2, 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$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)) [L820] 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_p1_EBX=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=2, 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] [L820] 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)) [L821] 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_p1_EBX=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=2, 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$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)) [L822] 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_p1_EBX=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=2, 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] [L822] 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)) [L824] 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_p1_EBX=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=2, 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] [L824] 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)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, 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] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=2, 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] [L773] 3 y = 1 [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=3, 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] [L780] 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=2, __unbuffered_p1_EBX=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=3, 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] [L780] 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) [L781] 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=2, __unbuffered_p1_EBX=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=3, 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] [L833] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=3, 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] [L781] 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)) [L782] 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=2, __unbuffered_p1_EBX=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=3, 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] [L782] 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)) [L783] 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=2, __unbuffered_p1_EBX=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=3, 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] [L783] 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)) [L784] 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=2, __unbuffered_p1_EBX=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=3, 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] [L784] 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)) [L785] 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=2, __unbuffered_p1_EBX=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=3, 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] [L785] 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)) [L786] 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=2, __unbuffered_p1_EBX=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=3, 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] [L786] 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)) [L787] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=3, 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] [L833] 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) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L868] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=3, 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] [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 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 [L871] 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, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.9s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4443 SDtfs, 5597 SDslu, 7028 SDs, 0 SdLazy, 1793 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298825occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 261724 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 901 NumberOfCodeBlocks, 901 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 813 ConstructedInterpolants, 0 QuantifiedInterpolants, 327381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...