./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/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 ea918d42d933f4ed9b4e29895b4572173e51bd23 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:19:22,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:19:22,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:19:22,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:19:22,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:19:22,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:19:22,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:19:22,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:19:22,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:19:22,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:19:22,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:19:22,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:19:22,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:19:22,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:19:22,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:19:22,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:19:22,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:19:22,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:19:22,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:19:22,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:19:22,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:19:22,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:19:22,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:19:22,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:19:22,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:19:22,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:19:22,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:19:22,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:19:22,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:19:22,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:19:22,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:19:22,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:19:22,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:19:22,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:19:22,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:19:22,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:19:22,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:19:22,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:19:22,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:19:22,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:19:22,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:19:22,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:19:22,754 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:19:22,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:19:22,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:19:22,755 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:19:22,755 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:19:22,755 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:19:22,755 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:19:22,755 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:19:22,756 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:19:22,756 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:19:22,756 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:19:22,756 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:19:22,756 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:19:22,756 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:19:22,757 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:19:22,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:19:22,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:19:22,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:19:22,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:19:22,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:19:22,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:22,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:19:22,759 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:19:22,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:19:22,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:19:22,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:19:22,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:19:22,760 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_199ec704-2acd-4cfc-933b-15bfab6c2c3c/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 -> ea918d42d933f4ed9b4e29895b4572173e51bd23 [2019-12-07 21:19:22,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:19:22,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:19:22,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:19:22,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:19:22,885 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:19:22,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i [2019-12-07 21:19:22,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/data/ef82e7258/45fa1ca6485441d396df15d046aca5f0/FLAGfd3a29544 [2019-12-07 21:19:23,401 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:19:23,401 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i [2019-12-07 21:19:23,413 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/data/ef82e7258/45fa1ca6485441d396df15d046aca5f0/FLAGfd3a29544 [2019-12-07 21:19:23,422 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/data/ef82e7258/45fa1ca6485441d396df15d046aca5f0 [2019-12-07 21:19:23,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:19:23,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:19:23,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:23,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:19:23,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:19:23,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5817f44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23, skipping insertion in model container [2019-12-07 21:19:23,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:19:23,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:19:23,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:23,728 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:19:23,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:19:23,822 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:19:23,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23 WrapperNode [2019-12-07 21:19:23,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:19:23,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:23,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:19:23,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:19:23,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:19:23,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:19:23,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:19:23,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:19:23,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... [2019-12-07 21:19:23,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:19:23,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:19:23,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:19:23,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:19:23,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:19:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:19:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:19:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:19:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:19:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:19:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:19:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:19:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:19:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:19:23,937 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:19:24,336 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:19:24,336 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:19:24,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:24 BoogieIcfgContainer [2019-12-07 21:19:24,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:19:24,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:19:24,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:19:24,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:19:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:19:23" (1/3) ... [2019-12-07 21:19:24,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a96d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:24, skipping insertion in model container [2019-12-07 21:19:24,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:19:23" (2/3) ... [2019-12-07 21:19:24,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a96d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:19:24, skipping insertion in model container [2019-12-07 21:19:24,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:24" (3/3) ... [2019-12-07 21:19:24,342 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_tso.opt.i [2019-12-07 21:19:24,349 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:19:24,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:19:24,354 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:19:24,355 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,411 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,421 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,422 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,423 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:19:24,434 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:19:24,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:19:24,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:19:24,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:19:24,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:19:24,446 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:19:24,446 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:19:24,446 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:19:24,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:19:24,457 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 21:19:24,458 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:19:24,523 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:19:24,524 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:19:24,536 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:19:24,558 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:19:24,601 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:19:24,601 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:19:24,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:19:24,635 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 21:19:24,636 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:19:28,261 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 21:19:28,561 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 21:19:28,685 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 21:19:28,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 21:19:28,687 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 21:19:36,949 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 21:19:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 21:19:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:19:36,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:36,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:36,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:36,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 21:19:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:36,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136929233] [2019-12-07 21:19:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:37,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136929233] [2019-12-07 21:19:37,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:37,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:19:37,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632673341] [2019-12-07 21:19:37,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:37,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:37,133 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 21:19:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:37,892 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 21:19:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:37,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:19:37,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:38,407 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 21:19:38,408 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 21:19:38,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 21:19:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 21:19:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 21:19:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 21:19:41,524 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 21:19:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:41,525 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 21:19:41,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:19:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 21:19:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:19:41,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:41,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:41,533 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 21:19:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898640209] [2019-12-07 21:19:41,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:41,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898640209] [2019-12-07 21:19:41,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:41,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:41,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545909036] [2019-12-07 21:19:41,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:41,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:41,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:41,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:41,595 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 21:19:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:43,897 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 21:19:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:43,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:19:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:44,284 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 21:19:44,285 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 21:19:44,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:19:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 21:19:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 21:19:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 21:19:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 21:19:48,161 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 21:19:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:48,161 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 21:19:48,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 21:19:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:19:48,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:48,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:48,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 21:19:48,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:48,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843479713] [2019-12-07 21:19:48,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:48,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843479713] [2019-12-07 21:19:48,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:48,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:19:48,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192665101] [2019-12-07 21:19:48,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:19:48,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:19:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:19:48,222 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 21:19:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:49,561 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 21:19:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:19:49,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:19:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:50,125 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 21:19:50,125 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 21:19:50,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:19:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 21:19:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 21:19:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 21:19:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 21:19:56,129 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 21:19:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:19:56,129 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 21:19:56,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:19:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 21:19:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:19:56,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:19:56,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:19:56,138 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:19:56,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:19:56,139 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 21:19:56,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:19:56,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027149164] [2019-12-07 21:19:56,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:19:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:19:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:19:56,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027149164] [2019-12-07 21:19:56,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:19:56,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:19:56,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757169051] [2019-12-07 21:19:56,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:19:56,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:19:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:19:56,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:19:56,174 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 21:19:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:19:57,733 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 21:19:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:19:57,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 21:19:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:19:58,445 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 21:19:58,445 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 21:19:58,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 21:20:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 21:20:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 21:20:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 21:20:08,303 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 21:20:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:08,304 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 21:20:08,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 21:20:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:20:08,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:08,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:08,319 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 21:20:08,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:08,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206625934] [2019-12-07 21:20:08,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206625934] [2019-12-07 21:20:08,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:08,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:20:08,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870164703] [2019-12-07 21:20:08,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:08,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:08,395 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 21:20:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:09,945 INFO L93 Difference]: Finished difference Result 329247 states and 1365659 transitions. [2019-12-07 21:20:09,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:09,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:20:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:10,865 INFO L225 Difference]: With dead ends: 329247 [2019-12-07 21:20:10,866 INFO L226 Difference]: Without dead ends: 328713 [2019-12-07 21:20:10,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328713 states. [2019-12-07 21:20:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328713 to 319924. [2019-12-07 21:20:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319924 states. [2019-12-07 21:20:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319924 states to 319924 states and 1338763 transitions. [2019-12-07 21:20:20,361 INFO L78 Accepts]: Start accepts. Automaton has 319924 states and 1338763 transitions. Word has length 20 [2019-12-07 21:20:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:20,361 INFO L462 AbstractCegarLoop]: Abstraction has 319924 states and 1338763 transitions. [2019-12-07 21:20:20,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 319924 states and 1338763 transitions. [2019-12-07 21:20:20,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:20:20,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:20,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:20,381 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:20,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:20,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1767153122, now seen corresponding path program 1 times [2019-12-07 21:20:20,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:20,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336565073] [2019-12-07 21:20:20,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:20,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336565073] [2019-12-07 21:20:20,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:20,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:20:20,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343207585] [2019-12-07 21:20:20,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:20,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:20,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:20,429 INFO L87 Difference]: Start difference. First operand 319924 states and 1338763 transitions. Second operand 5 states. [2019-12-07 21:20:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:20,986 INFO L93 Difference]: Finished difference Result 140231 states and 484420 transitions. [2019-12-07 21:20:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:20,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 21:20:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:21,229 INFO L225 Difference]: With dead ends: 140231 [2019-12-07 21:20:21,229 INFO L226 Difference]: Without dead ends: 120708 [2019-12-07 21:20:21,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120708 states. [2019-12-07 21:20:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120708 to 118501. [2019-12-07 21:20:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118501 states. [2019-12-07 21:20:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118501 states to 118501 states and 401451 transitions. [2019-12-07 21:20:26,498 INFO L78 Accepts]: Start accepts. Automaton has 118501 states and 401451 transitions. Word has length 21 [2019-12-07 21:20:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:26,499 INFO L462 AbstractCegarLoop]: Abstraction has 118501 states and 401451 transitions. [2019-12-07 21:20:26,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 118501 states and 401451 transitions. [2019-12-07 21:20:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:20:26,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:26,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:26,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 21:20:26,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:26,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788603564] [2019-12-07 21:20:26,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:26,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788603564] [2019-12-07 21:20:26,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:26,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:26,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414902705] [2019-12-07 21:20:26,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:26,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:26,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:26,539 INFO L87 Difference]: Start difference. First operand 118501 states and 401451 transitions. Second operand 4 states. [2019-12-07 21:20:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:27,211 INFO L93 Difference]: Finished difference Result 146761 states and 490136 transitions. [2019-12-07 21:20:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:27,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:20:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:27,490 INFO L225 Difference]: With dead ends: 146761 [2019-12-07 21:20:27,490 INFO L226 Difference]: Without dead ends: 146632 [2019-12-07 21:20:27,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146632 states. [2019-12-07 21:20:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146632 to 119985. [2019-12-07 21:20:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119985 states. [2019-12-07 21:20:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119985 states to 119985 states and 406298 transitions. [2019-12-07 21:20:30,385 INFO L78 Accepts]: Start accepts. Automaton has 119985 states and 406298 transitions. Word has length 21 [2019-12-07 21:20:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:30,385 INFO L462 AbstractCegarLoop]: Abstraction has 119985 states and 406298 transitions. [2019-12-07 21:20:30,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 119985 states and 406298 transitions. [2019-12-07 21:20:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:20:30,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:30,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:30,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 454438421, now seen corresponding path program 1 times [2019-12-07 21:20:30,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:30,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256748647] [2019-12-07 21:20:30,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256748647] [2019-12-07 21:20:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:30,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737803024] [2019-12-07 21:20:30,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:30,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:30,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:30,460 INFO L87 Difference]: Start difference. First operand 119985 states and 406298 transitions. Second operand 4 states. [2019-12-07 21:20:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:30,877 INFO L93 Difference]: Finished difference Result 117038 states and 396039 transitions. [2019-12-07 21:20:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:30,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:20:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:31,099 INFO L225 Difference]: With dead ends: 117038 [2019-12-07 21:20:31,099 INFO L226 Difference]: Without dead ends: 117038 [2019-12-07 21:20:31,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117038 states. [2019-12-07 21:20:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117038 to 80993. [2019-12-07 21:20:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80993 states. [2019-12-07 21:20:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80993 states to 80993 states and 272919 transitions. [2019-12-07 21:20:33,272 INFO L78 Accepts]: Start accepts. Automaton has 80993 states and 272919 transitions. Word has length 22 [2019-12-07 21:20:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:33,272 INFO L462 AbstractCegarLoop]: Abstraction has 80993 states and 272919 transitions. [2019-12-07 21:20:33,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 80993 states and 272919 transitions. [2019-12-07 21:20:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:20:33,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:33,285 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] [2019-12-07 21:20:33,285 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1382879271, now seen corresponding path program 1 times [2019-12-07 21:20:33,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:33,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87322258] [2019-12-07 21:20:33,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:33,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87322258] [2019-12-07 21:20:33,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:33,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:33,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567482452] [2019-12-07 21:20:33,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:33,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:33,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:33,327 INFO L87 Difference]: Start difference. First operand 80993 states and 272919 transitions. Second operand 5 states. [2019-12-07 21:20:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:34,048 INFO L93 Difference]: Finished difference Result 111380 states and 366219 transitions. [2019-12-07 21:20:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:20:34,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 21:20:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:34,251 INFO L225 Difference]: With dead ends: 111380 [2019-12-07 21:20:34,252 INFO L226 Difference]: Without dead ends: 111364 [2019-12-07 21:20:34,252 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 21:20:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111364 states. [2019-12-07 21:20:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111364 to 90404. [2019-12-07 21:20:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90404 states. [2019-12-07 21:20:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90404 states to 90404 states and 303179 transitions. [2019-12-07 21:20:36,480 INFO L78 Accepts]: Start accepts. Automaton has 90404 states and 303179 transitions. Word has length 26 [2019-12-07 21:20:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:36,480 INFO L462 AbstractCegarLoop]: Abstraction has 90404 states and 303179 transitions. [2019-12-07 21:20:36,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 90404 states and 303179 transitions. [2019-12-07 21:20:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:20:36,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:36,506 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 21:20:36,506 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-07 21:20:36,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:36,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861482520] [2019-12-07 21:20:36,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:36,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861482520] [2019-12-07 21:20:36,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:36,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:36,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200030802] [2019-12-07 21:20:36,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:36,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:36,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:36,551 INFO L87 Difference]: Start difference. First operand 90404 states and 303179 transitions. Second operand 5 states. [2019-12-07 21:20:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:37,300 INFO L93 Difference]: Finished difference Result 114961 states and 377416 transitions. [2019-12-07 21:20:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:20:37,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 21:20:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:37,510 INFO L225 Difference]: With dead ends: 114961 [2019-12-07 21:20:37,511 INFO L226 Difference]: Without dead ends: 114931 [2019-12-07 21:20:37,511 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 21:20:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114931 states. [2019-12-07 21:20:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114931 to 83048. [2019-12-07 21:20:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83048 states. [2019-12-07 21:20:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83048 states to 83048 states and 278911 transitions. [2019-12-07 21:20:39,645 INFO L78 Accepts]: Start accepts. Automaton has 83048 states and 278911 transitions. Word has length 29 [2019-12-07 21:20:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:39,645 INFO L462 AbstractCegarLoop]: Abstraction has 83048 states and 278911 transitions. [2019-12-07 21:20:39,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 83048 states and 278911 transitions. [2019-12-07 21:20:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:20:39,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:39,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:39,695 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash -875482127, now seen corresponding path program 1 times [2019-12-07 21:20:39,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:39,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135134838] [2019-12-07 21:20:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:39,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135134838] [2019-12-07 21:20:39,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:39,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:39,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051215587] [2019-12-07 21:20:39,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:39,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:39,750 INFO L87 Difference]: Start difference. First operand 83048 states and 278911 transitions. Second operand 4 states. [2019-12-07 21:20:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:40,216 INFO L93 Difference]: Finished difference Result 139948 states and 468543 transitions. [2019-12-07 21:20:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:40,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 21:20:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:40,341 INFO L225 Difference]: With dead ends: 139948 [2019-12-07 21:20:40,341 INFO L226 Difference]: Without dead ends: 68959 [2019-12-07 21:20:40,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68959 states. [2019-12-07 21:20:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68959 to 68683. [2019-12-07 21:20:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68683 states. [2019-12-07 21:20:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68683 states to 68683 states and 223305 transitions. [2019-12-07 21:20:41,946 INFO L78 Accepts]: Start accepts. Automaton has 68683 states and 223305 transitions. Word has length 36 [2019-12-07 21:20:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:41,946 INFO L462 AbstractCegarLoop]: Abstraction has 68683 states and 223305 transitions. [2019-12-07 21:20:41,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68683 states and 223305 transitions. [2019-12-07 21:20:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:20:41,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:41,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:41,992 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1447805739, now seen corresponding path program 1 times [2019-12-07 21:20:41,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:41,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411510829] [2019-12-07 21:20:41,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:42,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411510829] [2019-12-07 21:20:42,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:42,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:20:42,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878087852] [2019-12-07 21:20:42,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:20:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:20:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:42,030 INFO L87 Difference]: Start difference. First operand 68683 states and 223305 transitions. Second operand 3 states. [2019-12-07 21:20:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:42,229 INFO L93 Difference]: Finished difference Result 65223 states and 208949 transitions. [2019-12-07 21:20:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:20:42,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 21:20:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:42,332 INFO L225 Difference]: With dead ends: 65223 [2019-12-07 21:20:42,332 INFO L226 Difference]: Without dead ends: 65223 [2019-12-07 21:20:42,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:20:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65223 states. [2019-12-07 21:20:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65223 to 64476. [2019-12-07 21:20:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64476 states. [2019-12-07 21:20:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64476 states to 64476 states and 206895 transitions. [2019-12-07 21:20:43,789 INFO L78 Accepts]: Start accepts. Automaton has 64476 states and 206895 transitions. Word has length 37 [2019-12-07 21:20:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:43,789 INFO L462 AbstractCegarLoop]: Abstraction has 64476 states and 206895 transitions. [2019-12-07 21:20:43,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:20:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 64476 states and 206895 transitions. [2019-12-07 21:20:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 21:20:43,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:43,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:43,830 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1068803170, now seen corresponding path program 1 times [2019-12-07 21:20:43,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:43,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332016415] [2019-12-07 21:20:43,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:43,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332016415] [2019-12-07 21:20:43,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:43,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:20:43,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830102240] [2019-12-07 21:20:43,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:20:43,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:20:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:20:43,945 INFO L87 Difference]: Start difference. First operand 64476 states and 206895 transitions. Second operand 10 states. [2019-12-07 21:20:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:45,845 INFO L93 Difference]: Finished difference Result 116442 states and 383206 transitions. [2019-12-07 21:20:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 21:20:45,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-07 21:20:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:46,062 INFO L225 Difference]: With dead ends: 116442 [2019-12-07 21:20:46,062 INFO L226 Difference]: Without dead ends: 116442 [2019-12-07 21:20:46,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:20:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116442 states. [2019-12-07 21:20:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116442 to 89142. [2019-12-07 21:20:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89142 states. [2019-12-07 21:20:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89142 states to 89142 states and 293100 transitions. [2019-12-07 21:20:48,275 INFO L78 Accepts]: Start accepts. Automaton has 89142 states and 293100 transitions. Word has length 38 [2019-12-07 21:20:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:48,276 INFO L462 AbstractCegarLoop]: Abstraction has 89142 states and 293100 transitions. [2019-12-07 21:20:48,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:20:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89142 states and 293100 transitions. [2019-12-07 21:20:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 21:20:48,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:48,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:48,349 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash 961553006, now seen corresponding path program 2 times [2019-12-07 21:20:48,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:48,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646797584] [2019-12-07 21:20:48,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:48,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646797584] [2019-12-07 21:20:48,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:48,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:20:48,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154887013] [2019-12-07 21:20:48,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:20:48,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:20:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:20:48,400 INFO L87 Difference]: Start difference. First operand 89142 states and 293100 transitions. Second operand 6 states. [2019-12-07 21:20:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:48,514 INFO L93 Difference]: Finished difference Result 26612 states and 79606 transitions. [2019-12-07 21:20:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:48,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 21:20:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:48,538 INFO L225 Difference]: With dead ends: 26612 [2019-12-07 21:20:48,538 INFO L226 Difference]: Without dead ends: 21209 [2019-12-07 21:20:48,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:20:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21209 states. [2019-12-07 21:20:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21209 to 17405. [2019-12-07 21:20:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17405 states. [2019-12-07 21:20:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17405 states to 17405 states and 49627 transitions. [2019-12-07 21:20:48,782 INFO L78 Accepts]: Start accepts. Automaton has 17405 states and 49627 transitions. Word has length 38 [2019-12-07 21:20:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:48,782 INFO L462 AbstractCegarLoop]: Abstraction has 17405 states and 49627 transitions. [2019-12-07 21:20:48,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:20:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17405 states and 49627 transitions. [2019-12-07 21:20:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:20:48,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:48,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:48,797 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash -438264466, now seen corresponding path program 1 times [2019-12-07 21:20:48,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:48,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768380170] [2019-12-07 21:20:48,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:48,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 21:20:48,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768380170] [2019-12-07 21:20:48,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:48,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:20:48,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532051847] [2019-12-07 21:20:48,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:20:48,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:20:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:48,857 INFO L87 Difference]: Start difference. First operand 17405 states and 49627 transitions. Second operand 7 states. [2019-12-07 21:20:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:48,952 INFO L93 Difference]: Finished difference Result 15424 states and 45161 transitions. [2019-12-07 21:20:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:20:48,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 21:20:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:48,961 INFO L225 Difference]: With dead ends: 15424 [2019-12-07 21:20:48,961 INFO L226 Difference]: Without dead ends: 9008 [2019-12-07 21:20:48,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:20:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9008 states. [2019-12-07 21:20:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9008 to 6458. [2019-12-07 21:20:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6458 states. [2019-12-07 21:20:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6458 states to 6458 states and 18724 transitions. [2019-12-07 21:20:49,047 INFO L78 Accepts]: Start accepts. Automaton has 6458 states and 18724 transitions. Word has length 49 [2019-12-07 21:20:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:49,047 INFO L462 AbstractCegarLoop]: Abstraction has 6458 states and 18724 transitions. [2019-12-07 21:20:49,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:20:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6458 states and 18724 transitions. [2019-12-07 21:20:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:20:49,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:49,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:49,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1029868635, now seen corresponding path program 1 times [2019-12-07 21:20:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:49,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390444360] [2019-12-07 21:20:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:49,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390444360] [2019-12-07 21:20:49,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:49,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:20:49,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825682510] [2019-12-07 21:20:49,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:20:49,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:49,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:20:49,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:49,127 INFO L87 Difference]: Start difference. First operand 6458 states and 18724 transitions. Second operand 7 states. [2019-12-07 21:20:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:49,402 INFO L93 Difference]: Finished difference Result 14791 states and 42788 transitions. [2019-12-07 21:20:49,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:20:49,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 21:20:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:49,414 INFO L225 Difference]: With dead ends: 14791 [2019-12-07 21:20:49,414 INFO L226 Difference]: Without dead ends: 11722 [2019-12-07 21:20:49,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:20:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11722 states. [2019-12-07 21:20:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11722 to 10412. [2019-12-07 21:20:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10412 states. [2019-12-07 21:20:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 30499 transitions. [2019-12-07 21:20:49,544 INFO L78 Accepts]: Start accepts. Automaton has 10412 states and 30499 transitions. Word has length 65 [2019-12-07 21:20:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:49,544 INFO L462 AbstractCegarLoop]: Abstraction has 10412 states and 30499 transitions. [2019-12-07 21:20:49,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:20:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10412 states and 30499 transitions. [2019-12-07 21:20:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:20:49,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:49,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:49,553 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash -462511941, now seen corresponding path program 2 times [2019-12-07 21:20:49,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:49,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985997312] [2019-12-07 21:20:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:49,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985997312] [2019-12-07 21:20:49,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:49,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:49,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124098543] [2019-12-07 21:20:49,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:49,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:49,618 INFO L87 Difference]: Start difference. First operand 10412 states and 30499 transitions. Second operand 4 states. [2019-12-07 21:20:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:49,677 INFO L93 Difference]: Finished difference Result 11308 states and 32520 transitions. [2019-12-07 21:20:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:49,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:20:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:49,686 INFO L225 Difference]: With dead ends: 11308 [2019-12-07 21:20:49,686 INFO L226 Difference]: Without dead ends: 9241 [2019-12-07 21:20:49,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2019-12-07 21:20:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 8392. [2019-12-07 21:20:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8392 states. [2019-12-07 21:20:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 23452 transitions. [2019-12-07 21:20:49,785 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 23452 transitions. Word has length 65 [2019-12-07 21:20:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:49,785 INFO L462 AbstractCegarLoop]: Abstraction has 8392 states and 23452 transitions. [2019-12-07 21:20:49,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 23452 transitions. [2019-12-07 21:20:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:20:49,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:49,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:49,792 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash 376720393, now seen corresponding path program 3 times [2019-12-07 21:20:49,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:49,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139943028] [2019-12-07 21:20:49,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:49,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139943028] [2019-12-07 21:20:49,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:49,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:49,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553483229] [2019-12-07 21:20:49,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:49,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:49,851 INFO L87 Difference]: Start difference. First operand 8392 states and 23452 transitions. Second operand 4 states. [2019-12-07 21:20:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:49,905 INFO L93 Difference]: Finished difference Result 11428 states and 30742 transitions. [2019-12-07 21:20:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:49,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:20:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:49,915 INFO L225 Difference]: With dead ends: 11428 [2019-12-07 21:20:49,915 INFO L226 Difference]: Without dead ends: 9325 [2019-12-07 21:20:49,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9325 states. [2019-12-07 21:20:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9325 to 6336. [2019-12-07 21:20:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6336 states. [2019-12-07 21:20:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 18317 transitions. [2019-12-07 21:20:50,009 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 18317 transitions. Word has length 65 [2019-12-07 21:20:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:50,009 INFO L462 AbstractCegarLoop]: Abstraction has 6336 states and 18317 transitions. [2019-12-07 21:20:50,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 18317 transitions. [2019-12-07 21:20:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:20:50,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:50,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:50,015 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1094551306, now seen corresponding path program 1 times [2019-12-07 21:20:50,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:50,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404315668] [2019-12-07 21:20:50,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:50,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404315668] [2019-12-07 21:20:50,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:50,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:20:50,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838686253] [2019-12-07 21:20:50,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:50,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:50,075 INFO L87 Difference]: Start difference. First operand 6336 states and 18317 transitions. Second operand 5 states. [2019-12-07 21:20:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:50,123 INFO L93 Difference]: Finished difference Result 7243 states and 20360 transitions. [2019-12-07 21:20:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:50,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 21:20:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:50,127 INFO L225 Difference]: With dead ends: 7243 [2019-12-07 21:20:50,127 INFO L226 Difference]: Without dead ends: 3975 [2019-12-07 21:20:50,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-12-07 21:20:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3951. [2019-12-07 21:20:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-12-07 21:20:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 10110 transitions. [2019-12-07 21:20:50,166 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 10110 transitions. Word has length 66 [2019-12-07 21:20:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:50,166 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 10110 transitions. [2019-12-07 21:20:50,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 10110 transitions. [2019-12-07 21:20:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:20:50,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:50,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:50,168 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:50,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash 935217690, now seen corresponding path program 2 times [2019-12-07 21:20:50,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:50,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375266329] [2019-12-07 21:20:50,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:50,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375266329] [2019-12-07 21:20:50,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:50,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:20:50,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193570232] [2019-12-07 21:20:50,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:50,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:50,224 INFO L87 Difference]: Start difference. First operand 3951 states and 10110 transitions. Second operand 5 states. [2019-12-07 21:20:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:50,268 INFO L93 Difference]: Finished difference Result 4448 states and 11225 transitions. [2019-12-07 21:20:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:20:50,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 21:20:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:50,269 INFO L225 Difference]: With dead ends: 4448 [2019-12-07 21:20:50,269 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 21:20:50,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 21:20:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 21:20:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 21:20:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 21:20:50,274 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 66 [2019-12-07 21:20:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:50,274 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 21:20:50,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 21:20:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:20:50,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:50,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:50,275 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 3 times [2019-12-07 21:20:50,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:50,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244869871] [2019-12-07 21:20:50,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:50,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244869871] [2019-12-07 21:20:50,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:50,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:20:50,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112766491] [2019-12-07 21:20:50,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:20:50,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:20:50,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:50,339 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 21:20:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:50,499 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 21:20:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:20:50,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 21:20:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:50,500 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 21:20:50,500 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 21:20:50,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:20:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 21:20:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 21:20:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 21:20:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 21:20:50,506 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 21:20:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:50,507 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 21:20:50,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:20:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 21:20:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:20:50,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:50,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:50,507 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:50,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 4 times [2019-12-07 21:20:50,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:50,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991410599] [2019-12-07 21:20:50,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:20:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:20:50,577 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:20:50,577 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:20:50,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34|)) (= v_~z$r_buff0_thd2~0_131 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34| 1) |v_#valid_83|) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t549~0.base_34| 4) |v_#length_27|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t549~0.base_34|) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 |v_ULTIMATE.start_main_~#t549~0.offset_23|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34|) |v_ULTIMATE.start_main_~#t549~0.offset_23| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_22|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ULTIMATE.start_main_~#t549~0.offset=|v_ULTIMATE.start_main_~#t549~0.offset_23|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t549~0.base=|v_ULTIMATE.start_main_~#t549~0.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t551~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t552~0.base, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t549~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t549~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t551~0.base, ~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, ~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_~#t550~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t550~0.base, ~y~0, ~z$r_buff0_thd2~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_~#t552~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:20:50,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t550~0.base_11| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11|)) (= |v_ULTIMATE.start_main_~#t550~0.offset_10| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11|) |v_ULTIMATE.start_main_~#t550~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t550~0.base_11| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t550~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t550~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t550~0.base, #length] because there is no mapped edge [2019-12-07 21:20:50,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t551~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11|) |v_ULTIMATE.start_main_~#t551~0.offset_11| 2))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t551~0.base_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t551~0.base_11| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t551~0.base, ULTIMATE.start_main_~#t551~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:20:50,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t552~0.base_9|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9| 1) |v_#valid_35|) (not (= 0 |v_ULTIMATE.start_main_~#t552~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t552~0.offset_8|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9|) |v_ULTIMATE.start_main_~#t552~0.offset_8| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t552~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t552~0.base] because there is no mapped edge [2019-12-07 21:20:50,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd1~0_In1565311844 ~z$r_buff1_thd1~0_Out1565311844) (= ~z$r_buff1_thd0~0_Out1565311844 ~z$r_buff0_thd0~0_In1565311844) (= ~z$r_buff0_thd2~0_In1565311844 ~z$r_buff1_thd2~0_Out1565311844) (= ~weak$$choice2~0_Out1565311844 ~z$flush_delayed~0_Out1565311844) (= ~z$r_buff0_thd4~0_In1565311844 ~z$r_buff1_thd4~0_Out1565311844) (= |P3Thread1of1ForFork2_#t~nondet27_In1565311844| ~weak$$choice2~0_Out1565311844) (= |P3Thread1of1ForFork2_#t~nondet26_In1565311844| ~weak$$choice0~0_Out1565311844) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844 0)) (= ~z$r_buff0_thd4~0_Out1565311844 1) (= ~z~0_In1565311844 ~z$mem_tmp~0_Out1565311844) (= ~z$r_buff1_thd3~0_Out1565311844 ~z$r_buff0_thd3~0_In1565311844)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In1565311844|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In1565311844|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1565311844, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1565311844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1565311844, ~z~0=~z~0_In1565311844, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1565311844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565311844} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out1565311844|, ~z$mem_tmp~0=~z$mem_tmp~0_Out1565311844, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out1565311844|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1565311844, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1565311844, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1565311844, ~z$flush_delayed~0=~z$flush_delayed~0_Out1565311844, ~weak$$choice0~0=~weak$$choice0~0_Out1565311844, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1565311844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1565311844, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1565311844, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1565311844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1565311844, ~z~0=~z~0_In1565311844, ~weak$$choice2~0=~weak$$choice2~0_Out1565311844, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1565311844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565311844} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 21:20:50,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out-1537679450| |P3Thread1of1ForFork2_#t~ite28_Out-1537679450|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1537679450 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1537679450 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out-1537679450| ~z$w_buff0~0_In-1537679450)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out-1537679450| ~z$w_buff1~0_In-1537679450)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1537679450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537679450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1537679450, ~z$w_buff1~0=~z$w_buff1~0_In-1537679450} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1537679450|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1537679450|, ~z$w_buff0~0=~z$w_buff0~0_In-1537679450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537679450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1537679450, ~z$w_buff1~0=~z$w_buff1~0_In-1537679450} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:20:50,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:20:50,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1519263526 256)))) (or (and (= ~z~0_In1519263526 |P3Thread1of1ForFork2_#t~ite48_Out1519263526|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1519263526 |P3Thread1of1ForFork2_#t~ite48_Out1519263526|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1519263526, ~z$flush_delayed~0=~z$flush_delayed~0_In1519263526, ~z~0=~z~0_In1519263526} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1519263526, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1519263526|, ~z$flush_delayed~0=~z$flush_delayed~0_In1519263526, ~z~0=~z~0_In1519263526} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:20:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 21:20:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:20:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1859164797 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1859164797 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1859164797|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1859164797 |P3Thread1of1ForFork2_#t~ite51_Out-1859164797|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1859164797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1859164797} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1859164797|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1859164797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1859164797} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:20:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1765171494 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-1765171494 |P2Thread1of1ForFork1_#t~ite25_Out-1765171494|)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1765171494| ~z~0_In-1765171494) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1765171494, ~z$flush_delayed~0=~z$flush_delayed~0_In-1765171494, ~z~0=~z~0_In-1765171494} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1765171494, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1765171494|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1765171494, ~z~0=~z~0_In-1765171494} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:20:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1555822811 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1555822811 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1555822811 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1555822811 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1555822811| ~z$w_buff1_used~0_In1555822811) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1555822811|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1555822811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555822811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1555822811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1555822811} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1555822811|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1555822811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555822811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1555822811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1555822811} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:20:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out108719368 ~z$r_buff0_thd4~0_In108719368)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In108719368 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In108719368 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out108719368 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In108719368, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In108719368} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out108719368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108719368, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out108719368} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:20:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2049594316 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-2049594316 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2049594316 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2049594316 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-2049594316|)) (and (= ~z$r_buff1_thd4~0_In-2049594316 |P3Thread1of1ForFork2_#t~ite54_Out-2049594316|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2049594316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049594316, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2049594316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049594316} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2049594316|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2049594316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049594316, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2049594316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049594316} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:20:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:20:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:20:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:20:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In44711217 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In44711217 256) 0))) (or (and (= ~z~0_In44711217 |ULTIMATE.start_main_#t~ite59_Out44711217|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out44711217| ~z$w_buff1~0_In44711217) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In44711217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In44711217, ~z$w_buff1~0=~z$w_buff1~0_In44711217, ~z~0=~z~0_In44711217} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In44711217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In44711217, ~z$w_buff1~0=~z$w_buff1~0_In44711217, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out44711217|, ~z~0=~z~0_In44711217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:20:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:20:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2033983810 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2033983810 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-2033983810|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-2033983810| ~z$w_buff0_used~0_In-2033983810)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033983810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033983810} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033983810, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2033983810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033983810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:20:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1672970195 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1672970195 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1672970195 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1672970195 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1672970195|)) (and (= ~z$w_buff1_used~0_In-1672970195 |ULTIMATE.start_main_#t~ite62_Out-1672970195|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1672970195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1672970195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1672970195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1672970195} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1672970195|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1672970195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1672970195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1672970195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1672970195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:20:50,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1050810174 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1050810174 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1050810174| ~z$r_buff0_thd0~0_In1050810174)) (and (= |ULTIMATE.start_main_#t~ite63_Out1050810174| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050810174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050810174} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1050810174|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050810174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050810174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:20:50,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1139602735 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1139602735 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1139602735 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1139602735 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out1139602735| ~z$r_buff1_thd0~0_In1139602735) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1139602735|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139602735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139602735, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139602735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139602735} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139602735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139602735, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139602735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139602735, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1139602735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:20:50,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:20:50,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:20:50 BasicIcfg [2019-12-07 21:20:50,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:20:50,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:20:50,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:20:50,665 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:20:50,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:19:24" (3/4) ... [2019-12-07 21:20:50,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:20:50,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34|)) (= v_~z$r_buff0_thd2~0_131 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34| 1) |v_#valid_83|) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t549~0.base_34| 4) |v_#length_27|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t549~0.base_34|) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 |v_ULTIMATE.start_main_~#t549~0.offset_23|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34|) |v_ULTIMATE.start_main_~#t549~0.offset_23| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_22|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ULTIMATE.start_main_~#t549~0.offset=|v_ULTIMATE.start_main_~#t549~0.offset_23|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t549~0.base=|v_ULTIMATE.start_main_~#t549~0.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t551~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t552~0.base, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t549~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t549~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t551~0.base, ~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, ~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_~#t550~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t550~0.base, ~y~0, ~z$r_buff0_thd2~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_~#t552~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:20:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t550~0.base_11| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11|)) (= |v_ULTIMATE.start_main_~#t550~0.offset_10| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11|) |v_ULTIMATE.start_main_~#t550~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t550~0.base_11| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t550~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t550~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t550~0.base, #length] because there is no mapped edge [2019-12-07 21:20:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t551~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11|) |v_ULTIMATE.start_main_~#t551~0.offset_11| 2))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t551~0.base_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t551~0.base_11| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t551~0.base, ULTIMATE.start_main_~#t551~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:20:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t552~0.base_9|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9| 1) |v_#valid_35|) (not (= 0 |v_ULTIMATE.start_main_~#t552~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t552~0.offset_8|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9|) |v_ULTIMATE.start_main_~#t552~0.offset_8| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t552~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t552~0.base] because there is no mapped edge [2019-12-07 21:20:50,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd1~0_In1565311844 ~z$r_buff1_thd1~0_Out1565311844) (= ~z$r_buff1_thd0~0_Out1565311844 ~z$r_buff0_thd0~0_In1565311844) (= ~z$r_buff0_thd2~0_In1565311844 ~z$r_buff1_thd2~0_Out1565311844) (= ~weak$$choice2~0_Out1565311844 ~z$flush_delayed~0_Out1565311844) (= ~z$r_buff0_thd4~0_In1565311844 ~z$r_buff1_thd4~0_Out1565311844) (= |P3Thread1of1ForFork2_#t~nondet27_In1565311844| ~weak$$choice2~0_Out1565311844) (= |P3Thread1of1ForFork2_#t~nondet26_In1565311844| ~weak$$choice0~0_Out1565311844) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844 0)) (= ~z$r_buff0_thd4~0_Out1565311844 1) (= ~z~0_In1565311844 ~z$mem_tmp~0_Out1565311844) (= ~z$r_buff1_thd3~0_Out1565311844 ~z$r_buff0_thd3~0_In1565311844)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In1565311844|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In1565311844|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1565311844, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1565311844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1565311844, ~z~0=~z~0_In1565311844, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1565311844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565311844} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out1565311844|, ~z$mem_tmp~0=~z$mem_tmp~0_Out1565311844, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out1565311844|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1565311844, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1565311844, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1565311844, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1565311844, ~z$flush_delayed~0=~z$flush_delayed~0_Out1565311844, ~weak$$choice0~0=~weak$$choice0~0_Out1565311844, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1565311844, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1565311844, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1565311844, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1565311844, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1565311844, ~z~0=~z~0_In1565311844, ~weak$$choice2~0=~weak$$choice2~0_Out1565311844, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1565311844, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1565311844} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 21:20:50,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork2_#t~ite29_Out-1537679450| |P3Thread1of1ForFork2_#t~ite28_Out-1537679450|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1537679450 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1537679450 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out-1537679450| ~z$w_buff0~0_In-1537679450)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out-1537679450| ~z$w_buff1~0_In-1537679450)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1537679450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537679450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1537679450, ~z$w_buff1~0=~z$w_buff1~0_In-1537679450} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1537679450|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1537679450|, ~z$w_buff0~0=~z$w_buff0~0_In-1537679450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1537679450, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1537679450, ~z$w_buff1~0=~z$w_buff1~0_In-1537679450} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:20:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:20:50,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1519263526 256)))) (or (and (= ~z~0_In1519263526 |P3Thread1of1ForFork2_#t~ite48_Out1519263526|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1519263526 |P3Thread1of1ForFork2_#t~ite48_Out1519263526|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1519263526, ~z$flush_delayed~0=~z$flush_delayed~0_In1519263526, ~z~0=~z~0_In1519263526} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1519263526, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1519263526|, ~z$flush_delayed~0=~z$flush_delayed~0_In1519263526, ~z~0=~z~0_In1519263526} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:20:50,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 21:20:50,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:20:50,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1859164797 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1859164797 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1859164797|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1859164797 |P3Thread1of1ForFork2_#t~ite51_Out-1859164797|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1859164797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1859164797} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1859164797|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1859164797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1859164797} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:20:50,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1765171494 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-1765171494 |P2Thread1of1ForFork1_#t~ite25_Out-1765171494|)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1765171494| ~z~0_In-1765171494) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1765171494, ~z$flush_delayed~0=~z$flush_delayed~0_In-1765171494, ~z~0=~z~0_In-1765171494} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1765171494, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1765171494|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1765171494, ~z~0=~z~0_In-1765171494} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:20:50,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1555822811 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1555822811 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1555822811 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1555822811 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1555822811| ~z$w_buff1_used~0_In1555822811) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1555822811|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1555822811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555822811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1555822811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1555822811} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1555822811|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1555822811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1555822811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1555822811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1555822811} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:20:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out108719368 ~z$r_buff0_thd4~0_In108719368)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In108719368 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In108719368 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out108719368 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In108719368, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In108719368} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out108719368|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In108719368, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out108719368} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:20:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2049594316 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-2049594316 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-2049594316 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2049594316 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-2049594316|)) (and (= ~z$r_buff1_thd4~0_In-2049594316 |P3Thread1of1ForFork2_#t~ite54_Out-2049594316|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2049594316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049594316, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2049594316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049594316} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-2049594316|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2049594316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2049594316, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2049594316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2049594316} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:20:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:20:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:20:50,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:20:50,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In44711217 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In44711217 256) 0))) (or (and (= ~z~0_In44711217 |ULTIMATE.start_main_#t~ite59_Out44711217|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out44711217| ~z$w_buff1~0_In44711217) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In44711217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In44711217, ~z$w_buff1~0=~z$w_buff1~0_In44711217, ~z~0=~z~0_In44711217} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In44711217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In44711217, ~z$w_buff1~0=~z$w_buff1~0_In44711217, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out44711217|, ~z~0=~z~0_In44711217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:20:50,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:20:50,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2033983810 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2033983810 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-2033983810|) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-2033983810| ~z$w_buff0_used~0_In-2033983810)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033983810, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033983810} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2033983810, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2033983810|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033983810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:20:50,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1672970195 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1672970195 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1672970195 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1672970195 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1672970195|)) (and (= ~z$w_buff1_used~0_In-1672970195 |ULTIMATE.start_main_#t~ite62_Out-1672970195|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1672970195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1672970195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1672970195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1672970195} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1672970195|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1672970195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1672970195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1672970195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1672970195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:20:50,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1050810174 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1050810174 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1050810174| ~z$r_buff0_thd0~0_In1050810174)) (and (= |ULTIMATE.start_main_#t~ite63_Out1050810174| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050810174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050810174} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1050810174|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050810174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050810174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:20:50,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1139602735 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1139602735 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1139602735 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1139602735 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out1139602735| ~z$r_buff1_thd0~0_In1139602735) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1139602735|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139602735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139602735, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139602735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139602735} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1139602735, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1139602735, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1139602735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1139602735, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1139602735|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:20:50,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:20:50,745 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_199ec704-2acd-4cfc-933b-15bfab6c2c3c/bin/utaipan/witness.graphml [2019-12-07 21:20:50,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:20:50,747 INFO L168 Benchmark]: Toolchain (without parser) took 87321.78 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 934.0 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,747 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:50,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:50,748 INFO L168 Benchmark]: Boogie Preprocessor took 28.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,748 INFO L168 Benchmark]: RCFGBuilder took 444.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.4 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,748 INFO L168 Benchmark]: TraceAbstraction took 86326.53 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 996.4 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,748 INFO L168 Benchmark]: Witness Printer took 80.84 ms. Allocated memory is still 7.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:50,750 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 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.4 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86326.53 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 996.4 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 80.84 ms. Allocated memory is still 7.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t552, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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 = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.1s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5070 SDtfs, 6933 SDslu, 9416 SDs, 0 SdLazy, 3910 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319924occurred 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: 53.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 211456 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 857 NumberOfCodeBlocks, 857 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 770 ConstructedInterpolants, 0 QuantifiedInterpolants, 268691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...