./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/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 6b730660e2a081dac222ac1f77cb78bf07f46cb9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 11:30:42,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:30:42,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:30:42,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:30:42,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:30:42,697 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:30:42,698 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:30:42,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:30:42,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:30:42,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:30:42,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:30:42,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:30:42,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:30:42,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:30:42,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:30:42,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:30:42,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:30:42,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:30:42,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:30:42,705 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:30:42,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:30:42,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:30:42,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:30:42,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:30:42,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:30:42,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:30:42,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:30:42,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:30:42,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:30:42,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:30:42,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:30:42,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:30:42,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:30:42,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:30:42,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:30:42,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:30:42,711 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:30:42,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:30:42,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:30:42,719 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:30:42,719 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:30:42,719 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:30:42,719 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:30:42,720 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:30:42,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:30:42,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:30:42,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:30:42,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:30:42,722 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:30:42,723 INFO L133 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/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/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 -> 6b730660e2a081dac222ac1f77cb78bf07f46cb9 [2018-12-09 11:30:42,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:30:42,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:30:42,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:30:42,748 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:30:42,748 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:30:42,749 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_tso.opt_false-unreach-call.i [2018-12-09 11:30:42,783 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/data/58aec91cf/9681fbd2f1e74003836c4d41b7647913/FLAG0d05b02f0 [2018-12-09 11:30:43,249 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:30:43,249 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/sv-benchmarks/c/pthread-wmm/mix033_tso.opt_false-unreach-call.i [2018-12-09 11:30:43,256 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/data/58aec91cf/9681fbd2f1e74003836c4d41b7647913/FLAG0d05b02f0 [2018-12-09 11:30:43,264 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/data/58aec91cf/9681fbd2f1e74003836c4d41b7647913 [2018-12-09 11:30:43,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:30:43,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:30:43,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:30:43,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:30:43,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:30:43,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43, skipping insertion in model container [2018-12-09 11:30:43,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:30:43,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:30:43,470 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:30:43,478 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:30:43,554 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:30:43,585 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:30:43,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43 WrapperNode [2018-12-09 11:30:43,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:30:43,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:30:43,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:30:43,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:30:43,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:30:43,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:30:43,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:30:43,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:30:43,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... [2018-12-09 11:30:43,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:30:43,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:30:43,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:30:43,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:30:43,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/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 [2018-12-09 11:30:43,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:30:43,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:30:43,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 11:30:43,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:30:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 11:30:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 11:30:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 11:30:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 11:30:43,673 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 11:30:43,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 11:30:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 11:30:43,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:30:43,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:30:43,675 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 11:30:43,970 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:30:43,970 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 11:30:43,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:30:43 BoogieIcfgContainer [2018-12-09 11:30:43,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:30:43,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:30:43,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:30:43,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:30:43,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:30:43" (1/3) ... [2018-12-09 11:30:43,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692de1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:30:43, skipping insertion in model container [2018-12-09 11:30:43,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:30:43" (2/3) ... [2018-12-09 11:30:43,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692de1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:30:43, skipping insertion in model container [2018-12-09 11:30:43,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:30:43" (3/3) ... [2018-12-09 11:30:43,976 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.opt_false-unreach-call.i [2018-12-09 11:30:43,999 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,000 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,001 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,002 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,003 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,007 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,008 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,009 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,010 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,011 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,012 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,013 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,014 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,015 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,019 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,020 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:30:44,025 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 11:30:44,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:30:44,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 11:30:44,041 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 11:30:44,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:30:44,056 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:30:44,056 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:30:44,056 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:30:44,057 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:30:44,057 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:30:44,057 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:30:44,057 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:30:44,064 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148places, 179 transitions [2018-12-09 11:31:02,103 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149047 states. [2018-12-09 11:31:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149047 states. [2018-12-09 11:31:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:31:02,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:02,114 INFO L402 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] [2018-12-09 11:31:02,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:02,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash -552567723, now seen corresponding path program 1 times [2018-12-09 11:31:02,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:02,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:02,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:02,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:02,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:02,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:31:02,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:02,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:31:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:31:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:31:02,299 INFO L87 Difference]: Start difference. First operand 149047 states. Second operand 4 states. [2018-12-09 11:31:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:03,624 INFO L93 Difference]: Finished difference Result 257067 states and 1188606 transitions. [2018-12-09 11:31:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:31:03,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 11:31:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:04,280 INFO L225 Difference]: With dead ends: 257067 [2018-12-09 11:31:04,281 INFO L226 Difference]: Without dead ends: 174817 [2018-12-09 11:31:04,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:31:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174817 states. [2018-12-09 11:31:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174817 to 110557. [2018-12-09 11:31:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 11:31:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511488 transitions. [2018-12-09 11:31:09,353 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511488 transitions. Word has length 48 [2018-12-09 11:31:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511488 transitions. [2018-12-09 11:31:09,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:31:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511488 transitions. [2018-12-09 11:31:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 11:31:09,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:09,363 INFO L402 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] [2018-12-09 11:31:09,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:09,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1274372901, now seen corresponding path program 1 times [2018-12-09 11:31:09,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:09,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:09,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:09,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:31:09,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:09,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:31:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:31:09,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:31:09,413 INFO L87 Difference]: Start difference. First operand 110557 states and 511488 transitions. Second operand 3 states. [2018-12-09 11:31:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:09,938 INFO L93 Difference]: Finished difference Result 110557 states and 511383 transitions. [2018-12-09 11:31:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:31:09,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 11:31:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:10,228 INFO L225 Difference]: With dead ends: 110557 [2018-12-09 11:31:10,228 INFO L226 Difference]: Without dead ends: 110557 [2018-12-09 11:31:10,229 INFO L631 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 [2018-12-09 11:31:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110557 states. [2018-12-09 11:31:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110557 to 110557. [2018-12-09 11:31:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110557 states. [2018-12-09 11:31:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110557 states to 110557 states and 511383 transitions. [2018-12-09 11:31:12,758 INFO L78 Accepts]: Start accepts. Automaton has 110557 states and 511383 transitions. Word has length 56 [2018-12-09 11:31:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:12,758 INFO L480 AbstractCegarLoop]: Abstraction has 110557 states and 511383 transitions. [2018-12-09 11:31:12,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:31:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 110557 states and 511383 transitions. [2018-12-09 11:31:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 11:31:12,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:12,765 INFO L402 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] [2018-12-09 11:31:12,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:12,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash 468437434, now seen corresponding path program 1 times [2018-12-09 11:31:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:12,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:12,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:12,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:12,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:31:12,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:31:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:31:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:31:12,813 INFO L87 Difference]: Start difference. First operand 110557 states and 511383 transitions. Second operand 5 states. [2018-12-09 11:31:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:14,060 INFO L93 Difference]: Finished difference Result 240607 states and 1068638 transitions. [2018-12-09 11:31:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:31:14,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-12-09 11:31:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:16,937 INFO L225 Difference]: With dead ends: 240607 [2018-12-09 11:31:16,937 INFO L226 Difference]: Without dead ends: 237057 [2018-12-09 11:31:16,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:31:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237057 states. [2018-12-09 11:31:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237057 to 160437. [2018-12-09 11:31:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160437 states. [2018-12-09 11:31:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160437 states to 160437 states and 716827 transitions. [2018-12-09 11:31:20,484 INFO L78 Accepts]: Start accepts. Automaton has 160437 states and 716827 transitions. Word has length 56 [2018-12-09 11:31:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:20,484 INFO L480 AbstractCegarLoop]: Abstraction has 160437 states and 716827 transitions. [2018-12-09 11:31:20,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:31:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 160437 states and 716827 transitions. [2018-12-09 11:31:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:31:20,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:20,494 INFO L402 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] [2018-12-09 11:31:20,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:20,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1683293826, now seen corresponding path program 1 times [2018-12-09 11:31:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:20,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:20,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:20,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:20,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:31:20,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:31:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:31:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:31:20,559 INFO L87 Difference]: Start difference. First operand 160437 states and 716827 transitions. Second operand 5 states. [2018-12-09 11:31:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:22,486 INFO L93 Difference]: Finished difference Result 317177 states and 1405159 transitions. [2018-12-09 11:31:22,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:31:22,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 11:31:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:23,326 INFO L225 Difference]: With dead ends: 317177 [2018-12-09 11:31:23,326 INFO L226 Difference]: Without dead ends: 314277 [2018-12-09 11:31:23,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:31:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314277 states. [2018-12-09 11:31:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314277 to 178277. [2018-12-09 11:31:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178277 states. [2018-12-09 11:31:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178277 states to 178277 states and 791364 transitions. [2018-12-09 11:31:30,761 INFO L78 Accepts]: Start accepts. Automaton has 178277 states and 791364 transitions. Word has length 57 [2018-12-09 11:31:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 178277 states and 791364 transitions. [2018-12-09 11:31:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:31:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 178277 states and 791364 transitions. [2018-12-09 11:31:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 11:31:30,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:30,775 INFO L402 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] [2018-12-09 11:31:30,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:30,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -674729880, now seen corresponding path program 1 times [2018-12-09 11:31:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:30,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:30,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:30,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:30,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:31:30,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:30,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:31:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:31:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:31:30,805 INFO L87 Difference]: Start difference. First operand 178277 states and 791364 transitions. Second operand 3 states. [2018-12-09 11:31:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:32,107 INFO L93 Difference]: Finished difference Result 231657 states and 1011133 transitions. [2018-12-09 11:31:32,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:31:32,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 11:31:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:32,701 INFO L225 Difference]: With dead ends: 231657 [2018-12-09 11:31:32,701 INFO L226 Difference]: Without dead ends: 231657 [2018-12-09 11:31:32,701 INFO L631 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 [2018-12-09 11:31:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231657 states. [2018-12-09 11:31:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231657 to 202942. [2018-12-09 11:31:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202942 states. [2018-12-09 11:31:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202942 states to 202942 states and 893421 transitions. [2018-12-09 11:31:39,787 INFO L78 Accepts]: Start accepts. Automaton has 202942 states and 893421 transitions. Word has length 59 [2018-12-09 11:31:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 202942 states and 893421 transitions. [2018-12-09 11:31:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:31:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 202942 states and 893421 transitions. [2018-12-09 11:31:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 11:31:39,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:39,820 INFO L402 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] [2018-12-09 11:31:39,820 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash 978550790, now seen corresponding path program 1 times [2018-12-09 11:31:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:39,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:39,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:39,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:39,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:31:39,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:39,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:31:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:31:39,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:31:39,893 INFO L87 Difference]: Start difference. First operand 202942 states and 893421 transitions. Second operand 6 states. [2018-12-09 11:31:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:41,648 INFO L93 Difference]: Finished difference Result 278037 states and 1213527 transitions. [2018-12-09 11:31:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:31:41,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 11:31:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:42,360 INFO L225 Difference]: With dead ends: 278037 [2018-12-09 11:31:42,360 INFO L226 Difference]: Without dead ends: 273332 [2018-12-09 11:31:42,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:31:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273332 states. [2018-12-09 11:31:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273332 to 256762. [2018-12-09 11:31:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256762 states. [2018-12-09 11:31:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256762 states to 256762 states and 1124197 transitions. [2018-12-09 11:31:48,313 INFO L78 Accepts]: Start accepts. Automaton has 256762 states and 1124197 transitions. Word has length 63 [2018-12-09 11:31:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:31:48,314 INFO L480 AbstractCegarLoop]: Abstraction has 256762 states and 1124197 transitions. [2018-12-09 11:31:48,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:31:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 256762 states and 1124197 transitions. [2018-12-09 11:31:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 11:31:48,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:31:48,357 INFO L402 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] [2018-12-09 11:31:48,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:31:48,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:31:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -818400569, now seen corresponding path program 1 times [2018-12-09 11:31:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:31:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:48,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:31:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:31:48,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:31:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:31:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:31:48,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:31:48,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:31:48,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:31:48,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:31:48,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:31:48,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:31:48,419 INFO L87 Difference]: Start difference. First operand 256762 states and 1124197 transitions. Second operand 7 states. [2018-12-09 11:31:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:31:53,256 INFO L93 Difference]: Finished difference Result 367257 states and 1557913 transitions. [2018-12-09 11:31:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:31:53,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-09 11:31:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:31:54,163 INFO L225 Difference]: With dead ends: 367257 [2018-12-09 11:31:54,164 INFO L226 Difference]: Without dead ends: 367257 [2018-12-09 11:31:54,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:31:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367257 states. [2018-12-09 11:31:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367257 to 302982. [2018-12-09 11:31:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302982 states. [2018-12-09 11:32:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302982 states to 302982 states and 1302893 transitions. [2018-12-09 11:32:00,720 INFO L78 Accepts]: Start accepts. Automaton has 302982 states and 1302893 transitions. Word has length 63 [2018-12-09 11:32:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:00,720 INFO L480 AbstractCegarLoop]: Abstraction has 302982 states and 1302893 transitions. [2018-12-09 11:32:00,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:32:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 302982 states and 1302893 transitions. [2018-12-09 11:32:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 11:32:00,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:00,759 INFO L402 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] [2018-12-09 11:32:00,759 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:00,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash 69103112, now seen corresponding path program 1 times [2018-12-09 11:32:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:00,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:00,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:00,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:32:00,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:00,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:32:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:32:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:32:00,790 INFO L87 Difference]: Start difference. First operand 302982 states and 1302893 transitions. Second operand 4 states. [2018-12-09 11:32:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:02,336 INFO L93 Difference]: Finished difference Result 261613 states and 1104583 transitions. [2018-12-09 11:32:02,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:32:02,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 11:32:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:02,993 INFO L225 Difference]: With dead ends: 261613 [2018-12-09 11:32:02,993 INFO L226 Difference]: Without dead ends: 254858 [2018-12-09 11:32:02,993 INFO L631 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 [2018-12-09 11:32:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254858 states. [2018-12-09 11:32:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254858 to 254858. [2018-12-09 11:32:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254858 states. [2018-12-09 11:32:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254858 states to 254858 states and 1081014 transitions. [2018-12-09 11:32:12,228 INFO L78 Accepts]: Start accepts. Automaton has 254858 states and 1081014 transitions. Word has length 63 [2018-12-09 11:32:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:12,228 INFO L480 AbstractCegarLoop]: Abstraction has 254858 states and 1081014 transitions. [2018-12-09 11:32:12,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:32:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 254858 states and 1081014 transitions. [2018-12-09 11:32:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 11:32:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:12,253 INFO L402 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] [2018-12-09 11:32:12,253 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:12,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2071932979, now seen corresponding path program 1 times [2018-12-09 11:32:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:12,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:12,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:12,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:12,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:12,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:12,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:12,294 INFO L87 Difference]: Start difference. First operand 254858 states and 1081014 transitions. Second operand 6 states. [2018-12-09 11:32:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:14,596 INFO L93 Difference]: Finished difference Result 407574 states and 1714377 transitions. [2018-12-09 11:32:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:32:14,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 11:32:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:15,645 INFO L225 Difference]: With dead ends: 407574 [2018-12-09 11:32:15,645 INFO L226 Difference]: Without dead ends: 400393 [2018-12-09 11:32:15,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:32:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400393 states. [2018-12-09 11:32:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400393 to 259070. [2018-12-09 11:32:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259070 states. [2018-12-09 11:32:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259070 states to 259070 states and 1099301 transitions. [2018-12-09 11:32:22,104 INFO L78 Accepts]: Start accepts. Automaton has 259070 states and 1099301 transitions. Word has length 63 [2018-12-09 11:32:22,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:22,105 INFO L480 AbstractCegarLoop]: Abstraction has 259070 states and 1099301 transitions. [2018-12-09 11:32:22,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 259070 states and 1099301 transitions. [2018-12-09 11:32:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 11:32:22,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:22,140 INFO L402 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] [2018-12-09 11:32:22,140 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:22,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1391724770, now seen corresponding path program 1 times [2018-12-09 11:32:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:22,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:22,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:22,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:32:22,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:22,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:32:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:32:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:22,170 INFO L87 Difference]: Start difference. First operand 259070 states and 1099301 transitions. Second operand 5 states. [2018-12-09 11:32:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:22,389 INFO L93 Difference]: Finished difference Result 57902 states and 224525 transitions. [2018-12-09 11:32:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:32:22,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-09 11:32:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:22,489 INFO L225 Difference]: With dead ends: 57902 [2018-12-09 11:32:22,489 INFO L226 Difference]: Without dead ends: 50986 [2018-12-09 11:32:22,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:32:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50986 states. [2018-12-09 11:32:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50986 to 50746. [2018-12-09 11:32:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50746 states. [2018-12-09 11:32:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50746 states to 50746 states and 196312 transitions. [2018-12-09 11:32:23,644 INFO L78 Accepts]: Start accepts. Automaton has 50746 states and 196312 transitions. Word has length 64 [2018-12-09 11:32:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:23,645 INFO L480 AbstractCegarLoop]: Abstraction has 50746 states and 196312 transitions. [2018-12-09 11:32:23,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:32:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50746 states and 196312 transitions. [2018-12-09 11:32:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 11:32:23,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:23,659 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:23,660 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:23,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash -276513334, now seen corresponding path program 1 times [2018-12-09 11:32:23,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:23,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:23,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:32:23,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:23,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:32:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:32:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:32:23,696 INFO L87 Difference]: Start difference. First operand 50746 states and 196312 transitions. Second operand 4 states. [2018-12-09 11:32:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:23,957 INFO L93 Difference]: Finished difference Result 59865 states and 230931 transitions. [2018-12-09 11:32:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:32:23,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 11:32:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:24,071 INFO L225 Difference]: With dead ends: 59865 [2018-12-09 11:32:24,071 INFO L226 Difference]: Without dead ends: 59865 [2018-12-09 11:32:24,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59865 states. [2018-12-09 11:32:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59865 to 53961. [2018-12-09 11:32:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53961 states. [2018-12-09 11:32:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53961 states to 53961 states and 208379 transitions. [2018-12-09 11:32:24,848 INFO L78 Accepts]: Start accepts. Automaton has 53961 states and 208379 transitions. Word has length 74 [2018-12-09 11:32:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:24,848 INFO L480 AbstractCegarLoop]: Abstraction has 53961 states and 208379 transitions. [2018-12-09 11:32:24,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:32:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 53961 states and 208379 transitions. [2018-12-09 11:32:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 11:32:24,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:24,864 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:24,865 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:24,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1466297001, now seen corresponding path program 1 times [2018-12-09 11:32:24,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:24,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:24,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:24,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:24,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:24,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:24,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:24,905 INFO L87 Difference]: Start difference. First operand 53961 states and 208379 transitions. Second operand 6 states. [2018-12-09 11:32:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:25,590 INFO L93 Difference]: Finished difference Result 98120 states and 377173 transitions. [2018-12-09 11:32:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:32:25,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 11:32:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:25,787 INFO L225 Difference]: With dead ends: 98120 [2018-12-09 11:32:25,787 INFO L226 Difference]: Without dead ends: 97800 [2018-12-09 11:32:25,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:32:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97800 states. [2018-12-09 11:32:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97800 to 58186. [2018-12-09 11:32:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58186 states. [2018-12-09 11:32:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58186 states to 58186 states and 223570 transitions. [2018-12-09 11:32:26,889 INFO L78 Accepts]: Start accepts. Automaton has 58186 states and 223570 transitions. Word has length 74 [2018-12-09 11:32:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:26,890 INFO L480 AbstractCegarLoop]: Abstraction has 58186 states and 223570 transitions. [2018-12-09 11:32:26,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 58186 states and 223570 transitions. [2018-12-09 11:32:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 11:32:26,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:26,912 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:26,913 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:26,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1987377366, now seen corresponding path program 1 times [2018-12-09 11:32:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:26,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:26,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:26,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:32:26,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:26,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:32:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:32:26,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:32:26,951 INFO L87 Difference]: Start difference. First operand 58186 states and 223570 transitions. Second operand 4 states. [2018-12-09 11:32:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:27,379 INFO L93 Difference]: Finished difference Result 73349 states and 278574 transitions. [2018-12-09 11:32:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:32:27,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 11:32:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:27,499 INFO L225 Difference]: With dead ends: 73349 [2018-12-09 11:32:27,499 INFO L226 Difference]: Without dead ends: 73349 [2018-12-09 11:32:27,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:32:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73349 states. [2018-12-09 11:32:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73349 to 66713. [2018-12-09 11:32:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66713 states. [2018-12-09 11:32:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66713 states to 66713 states and 254002 transitions. [2018-12-09 11:32:28,424 INFO L78 Accepts]: Start accepts. Automaton has 66713 states and 254002 transitions. Word has length 76 [2018-12-09 11:32:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:28,424 INFO L480 AbstractCegarLoop]: Abstraction has 66713 states and 254002 transitions. [2018-12-09 11:32:28,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:32:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 66713 states and 254002 transitions. [2018-12-09 11:32:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 11:32:28,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:28,456 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:28,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:28,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -89831977, now seen corresponding path program 1 times [2018-12-09 11:32:28,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:28,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:28,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:28,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:32:28,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:28,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:32:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:32:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:32:28,487 INFO L87 Difference]: Start difference. First operand 66713 states and 254002 transitions. Second operand 3 states. [2018-12-09 11:32:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:28,787 INFO L93 Difference]: Finished difference Result 69475 states and 263647 transitions. [2018-12-09 11:32:28,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:32:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 11:32:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:28,914 INFO L225 Difference]: With dead ends: 69475 [2018-12-09 11:32:28,914 INFO L226 Difference]: Without dead ends: 69475 [2018-12-09 11:32:28,914 INFO L631 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 [2018-12-09 11:32:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69475 states. [2018-12-09 11:32:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69475 to 68223. [2018-12-09 11:32:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68223 states. [2018-12-09 11:32:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68223 states to 68223 states and 259246 transitions. [2018-12-09 11:32:29,920 INFO L78 Accepts]: Start accepts. Automaton has 68223 states and 259246 transitions. Word has length 76 [2018-12-09 11:32:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:29,920 INFO L480 AbstractCegarLoop]: Abstraction has 68223 states and 259246 transitions. [2018-12-09 11:32:29,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:32:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68223 states and 259246 transitions. [2018-12-09 11:32:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:32:29,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:29,957 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:29,957 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:29,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2086484495, now seen corresponding path program 1 times [2018-12-09 11:32:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:29,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:29,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:29,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:30,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:30,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:30,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:30,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:30,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:30,009 INFO L87 Difference]: Start difference. First operand 68223 states and 259246 transitions. Second operand 6 states. [2018-12-09 11:32:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:30,625 INFO L93 Difference]: Finished difference Result 82930 states and 311777 transitions. [2018-12-09 11:32:30,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:32:30,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 11:32:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:30,776 INFO L225 Difference]: With dead ends: 82930 [2018-12-09 11:32:30,776 INFO L226 Difference]: Without dead ends: 82930 [2018-12-09 11:32:30,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:32:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82930 states. [2018-12-09 11:32:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82930 to 78446. [2018-12-09 11:32:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78446 states. [2018-12-09 11:32:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78446 states to 78446 states and 296295 transitions. [2018-12-09 11:32:31,945 INFO L78 Accepts]: Start accepts. Automaton has 78446 states and 296295 transitions. Word has length 78 [2018-12-09 11:32:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:31,945 INFO L480 AbstractCegarLoop]: Abstraction has 78446 states and 296295 transitions. [2018-12-09 11:32:31,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 78446 states and 296295 transitions. [2018-12-09 11:32:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:32:31,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:31,991 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:31,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:31,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash 9275152, now seen corresponding path program 1 times [2018-12-09 11:32:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:31,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:32,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:32,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:32,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:32,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:32,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:32,041 INFO L87 Difference]: Start difference. First operand 78446 states and 296295 transitions. Second operand 6 states. [2018-12-09 11:32:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:32,514 INFO L93 Difference]: Finished difference Result 91980 states and 338638 transitions. [2018-12-09 11:32:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:32:32,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 11:32:32,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:32,679 INFO L225 Difference]: With dead ends: 91980 [2018-12-09 11:32:32,679 INFO L226 Difference]: Without dead ends: 91980 [2018-12-09 11:32:32,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:32:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91980 states. [2018-12-09 11:32:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91980 to 80035. [2018-12-09 11:32:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80035 states. [2018-12-09 11:32:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80035 states to 80035 states and 297460 transitions. [2018-12-09 11:32:33,908 INFO L78 Accepts]: Start accepts. Automaton has 80035 states and 297460 transitions. Word has length 78 [2018-12-09 11:32:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:33,908 INFO L480 AbstractCegarLoop]: Abstraction has 80035 states and 297460 transitions. [2018-12-09 11:32:33,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 80035 states and 297460 transitions. [2018-12-09 11:32:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:32:33,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:33,954 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:33,954 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:33,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:33,954 INFO L82 PathProgramCache]: Analyzing trace with hash 220626065, now seen corresponding path program 1 times [2018-12-09 11:32:33,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:33,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:33,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:33,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:33,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:34,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:32:34,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:32:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:32:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:34,001 INFO L87 Difference]: Start difference. First operand 80035 states and 297460 transitions. Second operand 5 states. [2018-12-09 11:32:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:34,487 INFO L93 Difference]: Finished difference Result 101344 states and 374908 transitions. [2018-12-09 11:32:34,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:32:34,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 11:32:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:34,692 INFO L225 Difference]: With dead ends: 101344 [2018-12-09 11:32:34,692 INFO L226 Difference]: Without dead ends: 101344 [2018-12-09 11:32:34,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:32:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101344 states. [2018-12-09 11:32:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101344 to 85990. [2018-12-09 11:32:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85990 states. [2018-12-09 11:32:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85990 states to 85990 states and 317478 transitions. [2018-12-09 11:32:36,047 INFO L78 Accepts]: Start accepts. Automaton has 85990 states and 317478 transitions. Word has length 78 [2018-12-09 11:32:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:36,048 INFO L480 AbstractCegarLoop]: Abstraction has 85990 states and 317478 transitions. [2018-12-09 11:32:36,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:32:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 85990 states and 317478 transitions. [2018-12-09 11:32:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:32:36,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:36,097 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:36,097 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:36,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash -289908112, now seen corresponding path program 1 times [2018-12-09 11:32:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:36,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:36,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:36,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:32:36,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:36,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:32:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:32:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:36,143 INFO L87 Difference]: Start difference. First operand 85990 states and 317478 transitions. Second operand 5 states. [2018-12-09 11:32:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:36,767 INFO L93 Difference]: Finished difference Result 115113 states and 423726 transitions. [2018-12-09 11:32:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:32:36,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-09 11:32:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:36,986 INFO L225 Difference]: With dead ends: 115113 [2018-12-09 11:32:36,986 INFO L226 Difference]: Without dead ends: 115113 [2018-12-09 11:32:36,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:32:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115113 states. [2018-12-09 11:32:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115113 to 90923. [2018-12-09 11:32:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90923 states. [2018-12-09 11:32:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90923 states to 90923 states and 335672 transitions. [2018-12-09 11:32:38,536 INFO L78 Accepts]: Start accepts. Automaton has 90923 states and 335672 transitions. Word has length 78 [2018-12-09 11:32:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:38,536 INFO L480 AbstractCegarLoop]: Abstraction has 90923 states and 335672 transitions. [2018-12-09 11:32:38,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:32:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90923 states and 335672 transitions. [2018-12-09 11:32:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 11:32:38,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:38,585 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:38,585 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:38,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:38,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2097362575, now seen corresponding path program 1 times [2018-12-09 11:32:38,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:38,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:38,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:38,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:38,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:38,628 INFO L87 Difference]: Start difference. First operand 90923 states and 335672 transitions. Second operand 6 states. [2018-12-09 11:32:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:38,751 INFO L93 Difference]: Finished difference Result 32107 states and 101608 transitions. [2018-12-09 11:32:38,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:32:38,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 11:32:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:38,781 INFO L225 Difference]: With dead ends: 32107 [2018-12-09 11:32:38,781 INFO L226 Difference]: Without dead ends: 25826 [2018-12-09 11:32:38,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:32:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25826 states. [2018-12-09 11:32:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25826 to 22406. [2018-12-09 11:32:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22406 states. [2018-12-09 11:32:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22406 states to 22406 states and 70115 transitions. [2018-12-09 11:32:39,026 INFO L78 Accepts]: Start accepts. Automaton has 22406 states and 70115 transitions. Word has length 78 [2018-12-09 11:32:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 22406 states and 70115 transitions. [2018-12-09 11:32:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 22406 states and 70115 transitions. [2018-12-09 11:32:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:32:39,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:39,046 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:39,046 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:39,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:39,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2022569740, now seen corresponding path program 1 times [2018-12-09 11:32:39,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:39,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:39,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:39,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:39,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:39,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:32:39,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:39,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:32:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:32:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:39,224 INFO L87 Difference]: Start difference. First operand 22406 states and 70115 transitions. Second operand 5 states. [2018-12-09 11:32:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:39,437 INFO L93 Difference]: Finished difference Result 26050 states and 80677 transitions. [2018-12-09 11:32:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:32:39,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 11:32:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:39,467 INFO L225 Difference]: With dead ends: 26050 [2018-12-09 11:32:39,467 INFO L226 Difference]: Without dead ends: 25880 [2018-12-09 11:32:39,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:32:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25880 states. [2018-12-09 11:32:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25880 to 23196. [2018-12-09 11:32:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23196 states. [2018-12-09 11:32:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23196 states to 23196 states and 72307 transitions. [2018-12-09 11:32:39,718 INFO L78 Accepts]: Start accepts. Automaton has 23196 states and 72307 transitions. Word has length 93 [2018-12-09 11:32:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:39,718 INFO L480 AbstractCegarLoop]: Abstraction has 23196 states and 72307 transitions. [2018-12-09 11:32:39,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:32:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23196 states and 72307 transitions. [2018-12-09 11:32:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:32:39,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:39,739 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:39,739 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:39,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 279372632, now seen corresponding path program 2 times [2018-12-09 11:32:39,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:39,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:39,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:39,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:39,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:39,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:39,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:39,793 INFO L87 Difference]: Start difference. First operand 23196 states and 72307 transitions. Second operand 6 states. [2018-12-09 11:32:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:40,025 INFO L93 Difference]: Finished difference Result 22278 states and 68975 transitions. [2018-12-09 11:32:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:32:40,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 11:32:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:40,051 INFO L225 Difference]: With dead ends: 22278 [2018-12-09 11:32:40,051 INFO L226 Difference]: Without dead ends: 22278 [2018-12-09 11:32:40,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:32:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22278 states. [2018-12-09 11:32:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22278 to 19896. [2018-12-09 11:32:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19896 states. [2018-12-09 11:32:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19896 states to 19896 states and 61457 transitions. [2018-12-09 11:32:40,255 INFO L78 Accepts]: Start accepts. Automaton has 19896 states and 61457 transitions. Word has length 93 [2018-12-09 11:32:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:40,255 INFO L480 AbstractCegarLoop]: Abstraction has 19896 states and 61457 transitions. [2018-12-09 11:32:40,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19896 states and 61457 transitions. [2018-12-09 11:32:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 11:32:40,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:40,273 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:40,273 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:40,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash 757086651, now seen corresponding path program 1 times [2018-12-09 11:32:40,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:40,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:32:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:40,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:32:40,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:40,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:32:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:32:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:40,343 INFO L87 Difference]: Start difference. First operand 19896 states and 61457 transitions. Second operand 6 states. [2018-12-09 11:32:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:40,444 INFO L93 Difference]: Finished difference Result 19832 states and 60673 transitions. [2018-12-09 11:32:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:32:40,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 11:32:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:40,465 INFO L225 Difference]: With dead ends: 19832 [2018-12-09 11:32:40,465 INFO L226 Difference]: Without dead ends: 19832 [2018-12-09 11:32:40,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:32:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2018-12-09 11:32:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 12643. [2018-12-09 11:32:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12643 states. [2018-12-09 11:32:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 38855 transitions. [2018-12-09 11:32:40,628 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 38855 transitions. Word has length 93 [2018-12-09 11:32:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:40,628 INFO L480 AbstractCegarLoop]: Abstraction has 12643 states and 38855 transitions. [2018-12-09 11:32:40,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:32:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 38855 transitions. [2018-12-09 11:32:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:40,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:40,640 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:40,640 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:40,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash -806376435, now seen corresponding path program 1 times [2018-12-09 11:32:40,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:40,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:40,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:40,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 11:32:40,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:40,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:32:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:32:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:32:40,728 INFO L87 Difference]: Start difference. First operand 12643 states and 38855 transitions. Second operand 10 states. [2018-12-09 11:32:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:41,066 INFO L93 Difference]: Finished difference Result 17627 states and 53938 transitions. [2018-12-09 11:32:41,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:32:41,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 11:32:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:41,084 INFO L225 Difference]: With dead ends: 17627 [2018-12-09 11:32:41,084 INFO L226 Difference]: Without dead ends: 17627 [2018-12-09 11:32:41,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 11:32:41,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2018-12-09 11:32:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 14586. [2018-12-09 11:32:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14586 states. [2018-12-09 11:32:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14586 states to 14586 states and 44740 transitions. [2018-12-09 11:32:41,239 INFO L78 Accepts]: Start accepts. Automaton has 14586 states and 44740 transitions. Word has length 95 [2018-12-09 11:32:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:41,239 INFO L480 AbstractCegarLoop]: Abstraction has 14586 states and 44740 transitions. [2018-12-09 11:32:41,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:32:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 14586 states and 44740 transitions. [2018-12-09 11:32:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:41,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:41,251 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:41,252 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:41,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 81127246, now seen corresponding path program 1 times [2018-12-09 11:32:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:41,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:41,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:41,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:41,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 11:32:41,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:41,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:32:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:32:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:32:41,341 INFO L87 Difference]: Start difference. First operand 14586 states and 44740 transitions. Second operand 10 states. [2018-12-09 11:32:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:41,913 INFO L93 Difference]: Finished difference Result 25870 states and 79255 transitions. [2018-12-09 11:32:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:32:41,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 11:32:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:41,926 INFO L225 Difference]: With dead ends: 25870 [2018-12-09 11:32:41,926 INFO L226 Difference]: Without dead ends: 12258 [2018-12-09 11:32:41,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 11:32:41,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2018-12-09 11:32:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 12258. [2018-12-09 11:32:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12258 states. [2018-12-09 11:32:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 37348 transitions. [2018-12-09 11:32:42,046 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 37348 transitions. Word has length 95 [2018-12-09 11:32:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:42,046 INFO L480 AbstractCegarLoop]: Abstraction has 12258 states and 37348 transitions. [2018-12-09 11:32:42,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:32:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 37348 transitions. [2018-12-09 11:32:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:42,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:42,056 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:42,056 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:42,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2014118738, now seen corresponding path program 2 times [2018-12-09 11:32:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:32:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:42,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:42,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:32:42,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:42,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:32:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:32:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:32:42,166 INFO L87 Difference]: Start difference. First operand 12258 states and 37348 transitions. Second operand 7 states. [2018-12-09 11:32:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:42,464 INFO L93 Difference]: Finished difference Result 20382 states and 62424 transitions. [2018-12-09 11:32:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:32:42,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 11:32:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:42,472 INFO L225 Difference]: With dead ends: 20382 [2018-12-09 11:32:42,472 INFO L226 Difference]: Without dead ends: 8326 [2018-12-09 11:32:42,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:32:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8326 states. [2018-12-09 11:32:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8326 to 8326. [2018-12-09 11:32:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2018-12-09 11:32:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 25597 transitions. [2018-12-09 11:32:42,545 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 25597 transitions. Word has length 95 [2018-12-09 11:32:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:42,546 INFO L480 AbstractCegarLoop]: Abstraction has 8326 states and 25597 transitions. [2018-12-09 11:32:42,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:32:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 25597 transitions. [2018-12-09 11:32:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:42,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:42,552 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:42,552 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:42,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1093378881, now seen corresponding path program 2 times [2018-12-09 11:32:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:32:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:42,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:32:42,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:42,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:32:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:32:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:32:42,623 INFO L87 Difference]: Start difference. First operand 8326 states and 25597 transitions. Second operand 5 states. [2018-12-09 11:32:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:42,657 INFO L93 Difference]: Finished difference Result 8326 states and 25533 transitions. [2018-12-09 11:32:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:32:42,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-09 11:32:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:42,667 INFO L225 Difference]: With dead ends: 8326 [2018-12-09 11:32:42,667 INFO L226 Difference]: Without dead ends: 8326 [2018-12-09 11:32:42,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:32:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8326 states. [2018-12-09 11:32:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8326 to 6874. [2018-12-09 11:32:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2018-12-09 11:32:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 21012 transitions. [2018-12-09 11:32:42,740 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 21012 transitions. Word has length 95 [2018-12-09 11:32:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:42,741 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 21012 transitions. [2018-12-09 11:32:42,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:32:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 21012 transitions. [2018-12-09 11:32:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:42,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:42,746 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:42,746 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:42,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -205875200, now seen corresponding path program 3 times [2018-12-09 11:32:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:32:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:42,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:32:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:32:42,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:32:42,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 11:32:42,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:32:42,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 11:32:42,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 11:32:42,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:32:42,838 INFO L87 Difference]: Start difference. First operand 6874 states and 21012 transitions. Second operand 11 states. [2018-12-09 11:32:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:32:43,389 INFO L93 Difference]: Finished difference Result 13270 states and 40729 transitions. [2018-12-09 11:32:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:32:43,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 11:32:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:32:43,397 INFO L225 Difference]: With dead ends: 13270 [2018-12-09 11:32:43,397 INFO L226 Difference]: Without dead ends: 7836 [2018-12-09 11:32:43,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 11:32:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2018-12-09 11:32:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7012. [2018-12-09 11:32:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7012 states. [2018-12-09 11:32:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 21219 transitions. [2018-12-09 11:32:43,462 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 21219 transitions. Word has length 95 [2018-12-09 11:32:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:32:43,462 INFO L480 AbstractCegarLoop]: Abstraction has 7012 states and 21219 transitions. [2018-12-09 11:32:43,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 11:32:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 21219 transitions. [2018-12-09 11:32:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 11:32:43,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:32:43,467 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:32:43,467 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:32:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:32:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash -455497410, now seen corresponding path program 4 times [2018-12-09 11:32:43,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:32:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:43,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:32:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:32:43,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:32:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:32:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:32:43,504 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:32:43,578 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 11:32:43,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:32:43 BasicIcfg [2018-12-09 11:32:43,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:32:43,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:32:43,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:32:43,580 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:32:43,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:30:43" (3/4) ... [2018-12-09 11:32:43,581 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:32:43,662 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ad3d6e5-a35a-45ab-a91f-2d45105b0893/bin-2019/utaipan/witness.graphml [2018-12-09 11:32:43,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:32:43,663 INFO L168 Benchmark]: Toolchain (without parser) took 120397.68 ms. Allocated memory was 1.0 GB in the beginning and 9.9 GB in the end (delta: 8.8 GB). Free memory was 950.6 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,664 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:32:43,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,665 INFO L168 Benchmark]: Boogie Preprocessor took 20.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,665 INFO L168 Benchmark]: RCFGBuilder took 331.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,665 INFO L168 Benchmark]: TraceAbstraction took 119607.96 ms. Allocated memory was 1.2 GB in the beginning and 9.9 GB in the end (delta: 8.7 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,665 INFO L168 Benchmark]: Witness Printer took 83.22 ms. Allocated memory is still 9.9 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:32:43,666 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 331.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119607.96 ms. Allocated memory was 1.2 GB in the beginning and 9.9 GB in the end (delta: 8.7 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 5.1 GB. Max. memory is 11.5 GB. * Witness Printer took 83.22 ms. Allocated memory is still 9.9 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L680] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L682] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L684] -1 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] -1 pthread_t t896; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] FCALL, FORK -1 pthread_create(&t896, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L808] -1 pthread_t t897; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L809] FCALL, FORK -1 pthread_create(&t897, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] -1 pthread_t t898; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L811] FCALL, FORK -1 pthread_create(&t898, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 a = 1 [L778] 0 __unbuffered_p2_EAX = a [L781] 0 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L714] 1 b = 1 [L717] 1 x = 1 [L722] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L729] 2 x = 2 [L732] 2 y = 1 [L735] 2 __unbuffered_p1_EAX = y [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L787] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L788] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L813] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L817] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L819] -1 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 [L820] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L821] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 221 locations, 3 error locations. UNSAFE Result, 119.5s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 33.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7676 SDtfs, 9569 SDslu, 18825 SDs, 0 SdLazy, 6755 SolverSat, 388 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 70 SyntacticMatches, 17 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302982occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 65.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 658374 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2009 ConstructedInterpolants, 0 QuantifiedInterpolants, 378274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...