./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc_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_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/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 daf28d8e47a2b9c408d64c16ab52dcf4c245b33d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:41:07,792 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:41:07,793 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:41:07,799 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:41:07,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:41:07,800 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:41:07,801 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:41:07,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:41:07,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:41:07,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:41:07,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:41:07,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:41:07,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:41:07,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:41:07,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:41:07,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:41:07,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:41:07,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:41:07,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:41:07,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:41:07,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:41:07,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:41:07,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:41:07,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:41:07,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:41:07,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:41:07,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:41:07,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:41:07,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:41:07,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:41:07,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:41:07,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:41:07,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:41:07,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:41:07,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:41:07,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:41:07,815 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:41:07,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:41:07,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:41:07,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:41:07,823 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:41:07,823 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:41:07,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:41:07,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:41:07,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:41:07,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:41:07,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:41:07,826 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:41:07,826 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_41892815-cb19-4e98-9501-c89379fabb91/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 -> daf28d8e47a2b9c408d64c16ab52dcf4c245b33d [2018-12-09 17:41:07,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:41:07,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:41:07,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:41:07,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:41:07,853 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:41:07,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix034_tso.oepc_false-unreach-call.i [2018-12-09 17:41:07,889 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/data/b4a1adac4/abc984b50001409380d98b15dc33fe2f/FLAG7af704d34 [2018-12-09 17:41:08,334 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:41:08,334 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/sv-benchmarks/c/pthread-wmm/mix034_tso.oepc_false-unreach-call.i [2018-12-09 17:41:08,342 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/data/b4a1adac4/abc984b50001409380d98b15dc33fe2f/FLAG7af704d34 [2018-12-09 17:41:08,350 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/data/b4a1adac4/abc984b50001409380d98b15dc33fe2f [2018-12-09 17:41:08,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:41:08,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:41:08,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:41:08,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:41:08,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:41:08,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,357 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 05:41:08, skipping insertion in model container [2018-12-09 17:41:08,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:41:08,383 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:41:08,556 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:41:08,564 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:41:08,639 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:41:08,668 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:41:08,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08 WrapperNode [2018-12-09 17:41:08,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:41:08,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:41:08,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:41:08,669 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:41:08,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:41:08,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:41:08,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:41:08,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:41:08,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... [2018-12-09 17:41:08,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:41:08,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:41:08,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:41:08,721 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:41:08,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/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 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 17:41:08,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 17:41:08,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 17:41:08,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 17:41:08,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:41:08,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:41:08,756 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 17:41:09,054 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:41:09,055 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 17:41:09,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:09 BoogieIcfgContainer [2018-12-09 17:41:09,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:41:09,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:41:09,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:41:09,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:41:09,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:41:08" (1/3) ... [2018-12-09 17:41:09,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc70f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:09, skipping insertion in model container [2018-12-09 17:41:09,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:41:08" (2/3) ... [2018-12-09 17:41:09,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc70f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:41:09, skipping insertion in model container [2018-12-09 17:41:09,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:09" (3/3) ... [2018-12-09 17:41:09,060 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc_false-unreach-call.i [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,083 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,084 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,084 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,084 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,085 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,086 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,087 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,088 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,089 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,090 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,091 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,092 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,093 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,094 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,095 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,096 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,097 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,098 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,099 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,100 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,101 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,102 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,103 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,104 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,105 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,106 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,107 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:41:09,111 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 17:41:09,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:41:09,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 17:41:09,132 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 17:41:09,152 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:41:09,152 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:41:09,152 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:41:09,152 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:41:09,153 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:41:09,153 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:41:09,153 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:41:09,153 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:41:09,163 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 182 transitions [2018-12-09 17:41:10,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34808 states. [2018-12-09 17:41:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34808 states. [2018-12-09 17:41:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:41:10,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:10,685 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] [2018-12-09 17:41:10,686 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:10,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 998748630, now seen corresponding path program 1 times [2018-12-09 17:41:10,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:10,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:10,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:10,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:10,822 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 17:41:10,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:10,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:10,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:10,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:10,837 INFO L87 Difference]: Start difference. First operand 34808 states. Second operand 4 states. [2018-12-09 17:41:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:11,327 INFO L93 Difference]: Finished difference Result 60792 states and 234495 transitions. [2018-12-09 17:41:11,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:41:11,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 17:41:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:11,489 INFO L225 Difference]: With dead ends: 60792 [2018-12-09 17:41:11,490 INFO L226 Difference]: Without dead ends: 44272 [2018-12-09 17:41:11,491 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 17:41:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44272 states. [2018-12-09 17:41:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44272 to 27340. [2018-12-09 17:41:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27340 states. [2018-12-09 17:41:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27340 states to 27340 states and 105501 transitions. [2018-12-09 17:41:12,231 INFO L78 Accepts]: Start accepts. Automaton has 27340 states and 105501 transitions. Word has length 35 [2018-12-09 17:41:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:12,232 INFO L480 AbstractCegarLoop]: Abstraction has 27340 states and 105501 transitions. [2018-12-09 17:41:12,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 27340 states and 105501 transitions. [2018-12-09 17:41:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 17:41:12,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:12,236 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] [2018-12-09 17:41:12,236 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:12,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:12,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1553228635, now seen corresponding path program 1 times [2018-12-09 17:41:12,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:12,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:12,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:12,288 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 17:41:12,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:12,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:12,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:12,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:12,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:12,290 INFO L87 Difference]: Start difference. First operand 27340 states and 105501 transitions. Second operand 4 states. [2018-12-09 17:41:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:12,339 INFO L93 Difference]: Finished difference Result 8530 states and 28346 transitions. [2018-12-09 17:41:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:12,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 17:41:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:12,353 INFO L225 Difference]: With dead ends: 8530 [2018-12-09 17:41:12,354 INFO L226 Difference]: Without dead ends: 7468 [2018-12-09 17:41:12,354 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 17:41:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7468 states. [2018-12-09 17:41:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7468 to 7468. [2018-12-09 17:41:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7468 states. [2018-12-09 17:41:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7468 states to 7468 states and 24638 transitions. [2018-12-09 17:41:12,439 INFO L78 Accepts]: Start accepts. Automaton has 7468 states and 24638 transitions. Word has length 47 [2018-12-09 17:41:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:12,439 INFO L480 AbstractCegarLoop]: Abstraction has 7468 states and 24638 transitions. [2018-12-09 17:41:12,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7468 states and 24638 transitions. [2018-12-09 17:41:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 17:41:12,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:12,441 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 17:41:12,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:12,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -508045602, now seen corresponding path program 1 times [2018-12-09 17:41:12,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:41:12,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:12,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:12,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:12,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:12,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:12,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:12,524 INFO L87 Difference]: Start difference. First operand 7468 states and 24638 transitions. Second operand 6 states. [2018-12-09 17:41:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:12,811 INFO L93 Difference]: Finished difference Result 9664 states and 31135 transitions. [2018-12-09 17:41:12,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:41:12,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-09 17:41:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:12,823 INFO L225 Difference]: With dead ends: 9664 [2018-12-09 17:41:12,823 INFO L226 Difference]: Without dead ends: 9596 [2018-12-09 17:41:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:41:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2018-12-09 17:41:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 9443. [2018-12-09 17:41:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9443 states. [2018-12-09 17:41:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 30544 transitions. [2018-12-09 17:41:12,937 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 30544 transitions. Word has length 48 [2018-12-09 17:41:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:12,938 INFO L480 AbstractCegarLoop]: Abstraction has 9443 states and 30544 transitions. [2018-12-09 17:41:12,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:12,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 30544 transitions. [2018-12-09 17:41:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 17:41:12,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:12,940 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] [2018-12-09 17:41:12,940 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:12,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1928335132, now seen corresponding path program 1 times [2018-12-09 17:41:12,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:12,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:12,978 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 17:41:12,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:12,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:41:12,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:12,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:41:12,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:41:12,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:41:12,980 INFO L87 Difference]: Start difference. First operand 9443 states and 30544 transitions. Second operand 3 states. [2018-12-09 17:41:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:13,112 INFO L93 Difference]: Finished difference Result 13281 states and 42643 transitions. [2018-12-09 17:41:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:41:13,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 17:41:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:13,129 INFO L225 Difference]: With dead ends: 13281 [2018-12-09 17:41:13,130 INFO L226 Difference]: Without dead ends: 13281 [2018-12-09 17:41:13,130 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 17:41:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13281 states. [2018-12-09 17:41:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13281 to 9847. [2018-12-09 17:41:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9847 states. [2018-12-09 17:41:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 31510 transitions. [2018-12-09 17:41:13,253 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 31510 transitions. Word has length 50 [2018-12-09 17:41:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:13,253 INFO L480 AbstractCegarLoop]: Abstraction has 9847 states and 31510 transitions. [2018-12-09 17:41:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:41:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 31510 transitions. [2018-12-09 17:41:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 17:41:13,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:13,254 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] [2018-12-09 17:41:13,254 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:13,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1510963439, now seen corresponding path program 1 times [2018-12-09 17:41:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:13,308 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 17:41:13,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:13,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:13,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:13,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:13,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:13,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:13,309 INFO L87 Difference]: Start difference. First operand 9847 states and 31510 transitions. Second operand 6 states. [2018-12-09 17:41:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:13,546 INFO L93 Difference]: Finished difference Result 14205 states and 45066 transitions. [2018-12-09 17:41:13,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:41:13,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 17:41:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:13,563 INFO L225 Difference]: With dead ends: 14205 [2018-12-09 17:41:13,563 INFO L226 Difference]: Without dead ends: 14133 [2018-12-09 17:41:13,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:41:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14133 states. [2018-12-09 17:41:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14133 to 10851. [2018-12-09 17:41:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10851 states. [2018-12-09 17:41:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10851 states to 10851 states and 34565 transitions. [2018-12-09 17:41:13,688 INFO L78 Accepts]: Start accepts. Automaton has 10851 states and 34565 transitions. Word has length 54 [2018-12-09 17:41:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:13,688 INFO L480 AbstractCegarLoop]: Abstraction has 10851 states and 34565 transitions. [2018-12-09 17:41:13,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10851 states and 34565 transitions. [2018-12-09 17:41:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 17:41:13,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:13,691 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] [2018-12-09 17:41:13,692 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:13,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 516780875, now seen corresponding path program 1 times [2018-12-09 17:41:13,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:13,748 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 17:41:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:13,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:13,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:13,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:13,749 INFO L87 Difference]: Start difference. First operand 10851 states and 34565 transitions. Second operand 4 states. [2018-12-09 17:41:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:13,837 INFO L93 Difference]: Finished difference Result 12398 states and 39574 transitions. [2018-12-09 17:41:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:13,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 17:41:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:13,852 INFO L225 Difference]: With dead ends: 12398 [2018-12-09 17:41:13,852 INFO L226 Difference]: Without dead ends: 12398 [2018-12-09 17:41:13,852 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 17:41:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12398 states. [2018-12-09 17:41:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12398 to 11371. [2018-12-09 17:41:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11371 states. [2018-12-09 17:41:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11371 states to 11371 states and 36238 transitions. [2018-12-09 17:41:13,971 INFO L78 Accepts]: Start accepts. Automaton has 11371 states and 36238 transitions. Word has length 62 [2018-12-09 17:41:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:13,971 INFO L480 AbstractCegarLoop]: Abstraction has 11371 states and 36238 transitions. [2018-12-09 17:41:13,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 11371 states and 36238 transitions. [2018-12-09 17:41:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 17:41:13,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:13,974 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] [2018-12-09 17:41:13,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:13,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2035376086, now seen corresponding path program 1 times [2018-12-09 17:41:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:13,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:14,034 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 17:41:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:14,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:14,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:14,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:14,036 INFO L87 Difference]: Start difference. First operand 11371 states and 36238 transitions. Second operand 6 states. [2018-12-09 17:41:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:14,344 INFO L93 Difference]: Finished difference Result 20971 states and 66488 transitions. [2018-12-09 17:41:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:41:14,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 17:41:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:14,373 INFO L225 Difference]: With dead ends: 20971 [2018-12-09 17:41:14,373 INFO L226 Difference]: Without dead ends: 20900 [2018-12-09 17:41:14,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:41:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20900 states. [2018-12-09 17:41:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 13757. [2018-12-09 17:41:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2018-12-09 17:41:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 43282 transitions. [2018-12-09 17:41:14,621 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 43282 transitions. Word has length 62 [2018-12-09 17:41:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:14,621 INFO L480 AbstractCegarLoop]: Abstraction has 13757 states and 43282 transitions. [2018-12-09 17:41:14,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 43282 transitions. [2018-12-09 17:41:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 17:41:14,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:14,625 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] [2018-12-09 17:41:14,626 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:14,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1982350530, now seen corresponding path program 1 times [2018-12-09 17:41:14,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:14,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:14,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:14,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:14,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:14,677 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 17:41:14,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:14,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:14,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:14,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:14,678 INFO L87 Difference]: Start difference. First operand 13757 states and 43282 transitions. Second operand 4 states. [2018-12-09 17:41:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:14,881 INFO L93 Difference]: Finished difference Result 17637 states and 54587 transitions. [2018-12-09 17:41:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:41:14,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 17:41:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:14,901 INFO L225 Difference]: With dead ends: 17637 [2018-12-09 17:41:14,901 INFO L226 Difference]: Without dead ends: 17637 [2018-12-09 17:41:14,901 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 17:41:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17637 states. [2018-12-09 17:41:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17637 to 15795. [2018-12-09 17:41:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15795 states. [2018-12-09 17:41:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 49133 transitions. [2018-12-09 17:41:15,070 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 49133 transitions. Word has length 66 [2018-12-09 17:41:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:15,070 INFO L480 AbstractCegarLoop]: Abstraction has 15795 states and 49133 transitions. [2018-12-09 17:41:15,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 49133 transitions. [2018-12-09 17:41:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 17:41:15,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:15,074 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] [2018-12-09 17:41:15,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:15,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:15,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2057880221, now seen corresponding path program 1 times [2018-12-09 17:41:15,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:15,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:15,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:15,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:15,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:15,102 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 17:41:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:15,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:41:15,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:15,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:41:15,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:41:15,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:41:15,103 INFO L87 Difference]: Start difference. First operand 15795 states and 49133 transitions. Second operand 3 states. [2018-12-09 17:41:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:15,239 INFO L93 Difference]: Finished difference Result 16387 states and 50740 transitions. [2018-12-09 17:41:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:41:15,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 17:41:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:15,258 INFO L225 Difference]: With dead ends: 16387 [2018-12-09 17:41:15,258 INFO L226 Difference]: Without dead ends: 16387 [2018-12-09 17:41:15,258 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 17:41:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16387 states. [2018-12-09 17:41:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16387 to 16111. [2018-12-09 17:41:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16111 states. [2018-12-09 17:41:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16111 states to 16111 states and 49983 transitions. [2018-12-09 17:41:15,421 INFO L78 Accepts]: Start accepts. Automaton has 16111 states and 49983 transitions. Word has length 66 [2018-12-09 17:41:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:15,421 INFO L480 AbstractCegarLoop]: Abstraction has 16111 states and 49983 transitions. [2018-12-09 17:41:15,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:41:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 16111 states and 49983 transitions. [2018-12-09 17:41:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:15,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:15,427 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] [2018-12-09 17:41:15,427 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:15,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash -356405788, now seen corresponding path program 1 times [2018-12-09 17:41:15,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:15,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:15,473 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 17:41:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:15,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:15,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:15,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:15,474 INFO L87 Difference]: Start difference. First operand 16111 states and 49983 transitions. Second operand 6 states. [2018-12-09 17:41:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:16,138 INFO L93 Difference]: Finished difference Result 19823 states and 60439 transitions. [2018-12-09 17:41:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:41:16,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:41:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:16,158 INFO L225 Difference]: With dead ends: 19823 [2018-12-09 17:41:16,158 INFO L226 Difference]: Without dead ends: 19823 [2018-12-09 17:41:16,158 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 17:41:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19823 states. [2018-12-09 17:41:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19823 to 18619. [2018-12-09 17:41:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18619 states. [2018-12-09 17:41:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18619 states to 18619 states and 57219 transitions. [2018-12-09 17:41:16,344 INFO L78 Accepts]: Start accepts. Automaton has 18619 states and 57219 transitions. Word has length 68 [2018-12-09 17:41:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:16,344 INFO L480 AbstractCegarLoop]: Abstraction has 18619 states and 57219 transitions. [2018-12-09 17:41:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18619 states and 57219 transitions. [2018-12-09 17:41:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:16,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:16,351 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] [2018-12-09 17:41:16,351 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:16,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:16,351 INFO L82 PathProgramCache]: Analyzing trace with hash -611142333, now seen corresponding path program 1 times [2018-12-09 17:41:16,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:16,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:16,424 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 17:41:16,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:16,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:16,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:16,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:16,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:16,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:16,425 INFO L87 Difference]: Start difference. First operand 18619 states and 57219 transitions. Second operand 6 states. [2018-12-09 17:41:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:16,708 INFO L93 Difference]: Finished difference Result 21451 states and 63628 transitions. [2018-12-09 17:41:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:41:16,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:41:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:16,730 INFO L225 Difference]: With dead ends: 21451 [2018-12-09 17:41:16,730 INFO L226 Difference]: Without dead ends: 21451 [2018-12-09 17:41:16,730 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 17:41:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21451 states. [2018-12-09 17:41:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21451 to 19135. [2018-12-09 17:41:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19135 states. [2018-12-09 17:41:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19135 states to 19135 states and 57766 transitions. [2018-12-09 17:41:16,928 INFO L78 Accepts]: Start accepts. Automaton has 19135 states and 57766 transitions. Word has length 68 [2018-12-09 17:41:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:16,928 INFO L480 AbstractCegarLoop]: Abstraction has 19135 states and 57766 transitions. [2018-12-09 17:41:16,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19135 states and 57766 transitions. [2018-12-09 17:41:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:16,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:16,935 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] [2018-12-09 17:41:16,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:16,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash -678149086, now seen corresponding path program 1 times [2018-12-09 17:41:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:16,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:16,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:16,983 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 17:41:16,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:16,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:16,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:16,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:16,984 INFO L87 Difference]: Start difference. First operand 19135 states and 57766 transitions. Second operand 5 states. [2018-12-09 17:41:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:17,232 INFO L93 Difference]: Finished difference Result 25026 states and 75020 transitions. [2018-12-09 17:41:17,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:41:17,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:41:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:17,260 INFO L225 Difference]: With dead ends: 25026 [2018-12-09 17:41:17,260 INFO L226 Difference]: Without dead ends: 25026 [2018-12-09 17:41:17,261 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 17:41:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25026 states. [2018-12-09 17:41:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25026 to 22711. [2018-12-09 17:41:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22711 states. [2018-12-09 17:41:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22711 states to 22711 states and 68034 transitions. [2018-12-09 17:41:17,517 INFO L78 Accepts]: Start accepts. Automaton has 22711 states and 68034 transitions. Word has length 68 [2018-12-09 17:41:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:17,517 INFO L480 AbstractCegarLoop]: Abstraction has 22711 states and 68034 transitions. [2018-12-09 17:41:17,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 22711 states and 68034 transitions. [2018-12-09 17:41:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:17,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:17,524 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] [2018-12-09 17:41:17,525 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:17,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:17,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1188683263, now seen corresponding path program 1 times [2018-12-09 17:41:17,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:17,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:17,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:17,591 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 17:41:17,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:17,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:17,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:17,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:17,592 INFO L87 Difference]: Start difference. First operand 22711 states and 68034 transitions. Second operand 5 states. [2018-12-09 17:41:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:17,901 INFO L93 Difference]: Finished difference Result 31961 states and 94873 transitions. [2018-12-09 17:41:17,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:41:17,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:41:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:17,941 INFO L225 Difference]: With dead ends: 31961 [2018-12-09 17:41:17,941 INFO L226 Difference]: Without dead ends: 31961 [2018-12-09 17:41:17,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 17:41:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31961 states. [2018-12-09 17:41:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31961 to 28241. [2018-12-09 17:41:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28241 states. [2018-12-09 17:41:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28241 states to 28241 states and 84261 transitions. [2018-12-09 17:41:18,322 INFO L78 Accepts]: Start accepts. Automaton has 28241 states and 84261 transitions. Word has length 68 [2018-12-09 17:41:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:18,322 INFO L480 AbstractCegarLoop]: Abstraction has 28241 states and 84261 transitions. [2018-12-09 17:41:18,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28241 states and 84261 transitions. [2018-12-09 17:41:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:18,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:18,331 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] [2018-12-09 17:41:18,331 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:18,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1298829570, now seen corresponding path program 1 times [2018-12-09 17:41:18,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:18,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:18,391 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 17:41:18,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:18,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:18,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:18,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:18,392 INFO L87 Difference]: Start difference. First operand 28241 states and 84261 transitions. Second operand 6 states. [2018-12-09 17:41:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:18,515 INFO L93 Difference]: Finished difference Result 28041 states and 79299 transitions. [2018-12-09 17:41:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:18,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:41:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:18,545 INFO L225 Difference]: With dead ends: 28041 [2018-12-09 17:41:18,545 INFO L226 Difference]: Without dead ends: 28041 [2018-12-09 17:41:18,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 17:41:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28041 states. [2018-12-09 17:41:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28041 to 23993. [2018-12-09 17:41:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23993 states. [2018-12-09 17:41:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23993 states to 23993 states and 68156 transitions. [2018-12-09 17:41:18,788 INFO L78 Accepts]: Start accepts. Automaton has 23993 states and 68156 transitions. Word has length 68 [2018-12-09 17:41:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:18,789 INFO L480 AbstractCegarLoop]: Abstraction has 23993 states and 68156 transitions. [2018-12-09 17:41:18,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23993 states and 68156 transitions. [2018-12-09 17:41:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:18,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:18,795 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] [2018-12-09 17:41:18,795 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:18,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash 389381892, now seen corresponding path program 1 times [2018-12-09 17:41:18,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:18,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:18,836 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 17:41:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:18,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:18,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:18,837 INFO L87 Difference]: Start difference. First operand 23993 states and 68156 transitions. Second operand 5 states. [2018-12-09 17:41:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:18,875 INFO L93 Difference]: Finished difference Result 7181 states and 17283 transitions. [2018-12-09 17:41:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:41:18,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:41:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:18,879 INFO L225 Difference]: With dead ends: 7181 [2018-12-09 17:41:18,879 INFO L226 Difference]: Without dead ends: 5896 [2018-12-09 17:41:18,879 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 17:41:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2018-12-09 17:41:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5236. [2018-12-09 17:41:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5236 states. [2018-12-09 17:41:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 12141 transitions. [2018-12-09 17:41:18,915 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 12141 transitions. Word has length 68 [2018-12-09 17:41:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:18,915 INFO L480 AbstractCegarLoop]: Abstraction has 5236 states and 12141 transitions. [2018-12-09 17:41:18,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 12141 transitions. [2018-12-09 17:41:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:41:18,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:18,919 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] [2018-12-09 17:41:18,919 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:18,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:18,919 INFO L82 PathProgramCache]: Analyzing trace with hash -342568837, now seen corresponding path program 1 times [2018-12-09 17:41:18,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:18,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:18,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:18,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:18,932 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 17:41:18,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:18,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:41:18,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:41:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:41:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:41:18,933 INFO L87 Difference]: Start difference. First operand 5236 states and 12141 transitions. Second operand 3 states. [2018-12-09 17:41:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:18,983 INFO L93 Difference]: Finished difference Result 6577 states and 15019 transitions. [2018-12-09 17:41:18,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:41:18,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 17:41:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:18,987 INFO L225 Difference]: With dead ends: 6577 [2018-12-09 17:41:18,987 INFO L226 Difference]: Without dead ends: 6577 [2018-12-09 17:41:18,987 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 17:41:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2018-12-09 17:41:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 5175. [2018-12-09 17:41:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2018-12-09 17:41:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 11681 transitions. [2018-12-09 17:41:19,024 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 11681 transitions. Word has length 68 [2018-12-09 17:41:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,024 INFO L480 AbstractCegarLoop]: Abstraction has 5175 states and 11681 transitions. [2018-12-09 17:41:19,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:41:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 11681 transitions. [2018-12-09 17:41:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 17:41:19,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,028 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 17:41:19,028 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash -571353426, now seen corresponding path program 1 times [2018-12-09 17:41:19,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,062 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 17:41:19,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:19,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:19,063 INFO L87 Difference]: Start difference. First operand 5175 states and 11681 transitions. Second operand 5 states. [2018-12-09 17:41:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:19,161 INFO L93 Difference]: Finished difference Result 6325 states and 14274 transitions. [2018-12-09 17:41:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:41:19,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 17:41:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:19,166 INFO L225 Difference]: With dead ends: 6325 [2018-12-09 17:41:19,166 INFO L226 Difference]: Without dead ends: 6325 [2018-12-09 17:41:19,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:41:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2018-12-09 17:41:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 5619. [2018-12-09 17:41:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5619 states. [2018-12-09 17:41:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 12685 transitions. [2018-12-09 17:41:19,203 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 12685 transitions. Word has length 74 [2018-12-09 17:41:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 5619 states and 12685 transitions. [2018-12-09 17:41:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 12685 transitions. [2018-12-09 17:41:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 17:41:19,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,206 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 17:41:19,207 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1171456909, now seen corresponding path program 1 times [2018-12-09 17:41:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,247 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 17:41:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:41:19,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:41:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:41:19,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:41:19,248 INFO L87 Difference]: Start difference. First operand 5619 states and 12685 transitions. Second operand 7 states. [2018-12-09 17:41:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:19,459 INFO L93 Difference]: Finished difference Result 6586 states and 14710 transitions. [2018-12-09 17:41:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:41:19,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 17:41:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:19,463 INFO L225 Difference]: With dead ends: 6586 [2018-12-09 17:41:19,464 INFO L226 Difference]: Without dead ends: 6484 [2018-12-09 17:41:19,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 17:41:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2018-12-09 17:41:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 5716. [2018-12-09 17:41:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-09 17:41:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12778 transitions. [2018-12-09 17:41:19,503 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12778 transitions. Word has length 74 [2018-12-09 17:41:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,503 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12778 transitions. [2018-12-09 17:41:19,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:41:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12778 transitions. [2018-12-09 17:41:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 17:41:19,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,506 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 17:41:19,507 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2144466605, now seen corresponding path program 1 times [2018-12-09 17:41:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,587 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 17:41:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:41:19,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:41:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:41:19,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:41:19,588 INFO L87 Difference]: Start difference. First operand 5716 states and 12778 transitions. Second operand 7 states. [2018-12-09 17:41:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:19,906 INFO L93 Difference]: Finished difference Result 7199 states and 16113 transitions. [2018-12-09 17:41:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:41:19,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 17:41:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:19,911 INFO L225 Difference]: With dead ends: 7199 [2018-12-09 17:41:19,911 INFO L226 Difference]: Without dead ends: 7199 [2018-12-09 17:41:19,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:41:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2018-12-09 17:41:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 5856. [2018-12-09 17:41:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2018-12-09 17:41:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 13166 transitions. [2018-12-09 17:41:19,954 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 13166 transitions. Word has length 95 [2018-12-09 17:41:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 5856 states and 13166 transitions. [2018-12-09 17:41:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:41:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 13166 transitions. [2018-12-09 17:41:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 17:41:19,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:19,958 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 17:41:19,958 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:19,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1598659536, now seen corresponding path program 1 times [2018-12-09 17:41:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:19,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:19,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:19,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:19,993 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 17:41:19,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:19,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:19,993 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:19,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:19,994 INFO L87 Difference]: Start difference. First operand 5856 states and 13166 transitions. Second operand 4 states. [2018-12-09 17:41:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,047 INFO L93 Difference]: Finished difference Result 6980 states and 15568 transitions. [2018-12-09 17:41:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:41:20,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 17:41:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,052 INFO L225 Difference]: With dead ends: 6980 [2018-12-09 17:41:20,052 INFO L226 Difference]: Without dead ends: 6980 [2018-12-09 17:41:20,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:41:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-09 17:41:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 6213. [2018-12-09 17:41:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2018-12-09 17:41:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 13936 transitions. [2018-12-09 17:41:20,106 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 13936 transitions. Word has length 95 [2018-12-09 17:41:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,106 INFO L480 AbstractCegarLoop]: Abstraction has 6213 states and 13936 transitions. [2018-12-09 17:41:20,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 13936 transitions. [2018-12-09 17:41:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:20,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,110 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, 1, 1] [2018-12-09 17:41:20,110 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1803412790, now seen corresponding path program 1 times [2018-12-09 17:41:20,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,155 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 17:41:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:20,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:20,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:20,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:20,155 INFO L87 Difference]: Start difference. First operand 6213 states and 13936 transitions. Second operand 5 states. [2018-12-09 17:41:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,215 INFO L93 Difference]: Finished difference Result 6659 states and 14882 transitions. [2018-12-09 17:41:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:41:20,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 17:41:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,219 INFO L225 Difference]: With dead ends: 6659 [2018-12-09 17:41:20,219 INFO L226 Difference]: Without dead ends: 6659 [2018-12-09 17:41:20,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 17:41:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2018-12-09 17:41:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 5109. [2018-12-09 17:41:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5109 states. [2018-12-09 17:41:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 11452 transitions. [2018-12-09 17:41:20,260 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 11452 transitions. Word has length 97 [2018-12-09 17:41:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,260 INFO L480 AbstractCegarLoop]: Abstraction has 5109 states and 11452 transitions. [2018-12-09 17:41:20,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 11452 transitions. [2018-12-09 17:41:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:20,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,263 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, 1, 1] [2018-12-09 17:41:20,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1814728917, now seen corresponding path program 1 times [2018-12-09 17:41:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,298 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 17:41:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:41:20,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:20,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:41:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:41:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:41:20,300 INFO L87 Difference]: Start difference. First operand 5109 states and 11452 transitions. Second operand 4 states. [2018-12-09 17:41:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,430 INFO L93 Difference]: Finished difference Result 6613 states and 14743 transitions. [2018-12-09 17:41:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:41:20,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 17:41:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,434 INFO L225 Difference]: With dead ends: 6613 [2018-12-09 17:41:20,434 INFO L226 Difference]: Without dead ends: 6566 [2018-12-09 17:41:20,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:41:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6566 states. [2018-12-09 17:41:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6566 to 6157. [2018-12-09 17:41:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6157 states. [2018-12-09 17:41:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 13768 transitions. [2018-12-09 17:41:20,478 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 13768 transitions. Word has length 97 [2018-12-09 17:41:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 6157 states and 13768 transitions. [2018-12-09 17:41:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:41:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 13768 transitions. [2018-12-09 17:41:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:20,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:20,482 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, 1, 1] [2018-12-09 17:41:20,482 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:20,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash -262480426, now seen corresponding path program 1 times [2018-12-09 17:41:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:20,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:20,581 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 17:41:20,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:20,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:41:20,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:20,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:41:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:41:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:41:20,582 INFO L87 Difference]: Start difference. First operand 6157 states and 13768 transitions. Second operand 9 states. [2018-12-09 17:41:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:20,944 INFO L93 Difference]: Finished difference Result 7878 states and 17405 transitions. [2018-12-09 17:41:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 17:41:20,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-09 17:41:20,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:20,949 INFO L225 Difference]: With dead ends: 7878 [2018-12-09 17:41:20,950 INFO L226 Difference]: Without dead ends: 7878 [2018-12-09 17:41:20,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-09 17:41:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2018-12-09 17:41:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 6683. [2018-12-09 17:41:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2018-12-09 17:41:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 14838 transitions. [2018-12-09 17:41:21,004 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 14838 transitions. Word has length 97 [2018-12-09 17:41:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:21,004 INFO L480 AbstractCegarLoop]: Abstraction has 6683 states and 14838 transitions. [2018-12-09 17:41:21,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:41:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 14838 transitions. [2018-12-09 17:41:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:21,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:21,009 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, 1, 1] [2018-12-09 17:41:21,009 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:21,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash -51129513, now seen corresponding path program 1 times [2018-12-09 17:41:21,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:21,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:21,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:21,113 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 17:41:21,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:21,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 17:41:21,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:21,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 17:41:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 17:41:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:41:21,114 INFO L87 Difference]: Start difference. First operand 6683 states and 14838 transitions. Second operand 11 states. [2018-12-09 17:41:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:21,961 INFO L93 Difference]: Finished difference Result 12276 states and 27352 transitions. [2018-12-09 17:41:21,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 17:41:21,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-12-09 17:41:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:21,967 INFO L225 Difference]: With dead ends: 12276 [2018-12-09 17:41:21,967 INFO L226 Difference]: Without dead ends: 8479 [2018-12-09 17:41:21,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 17:41:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8479 states. [2018-12-09 17:41:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8479 to 6439. [2018-12-09 17:41:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6439 states. [2018-12-09 17:41:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6439 states to 6439 states and 14285 transitions. [2018-12-09 17:41:22,023 INFO L78 Accepts]: Start accepts. Automaton has 6439 states and 14285 transitions. Word has length 97 [2018-12-09 17:41:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:22,024 INFO L480 AbstractCegarLoop]: Abstraction has 6439 states and 14285 transitions. [2018-12-09 17:41:22,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 17:41:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 6439 states and 14285 transitions. [2018-12-09 17:41:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:22,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:22,029 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, 1, 1] [2018-12-09 17:41:22,029 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:22,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash 746604445, now seen corresponding path program 1 times [2018-12-09 17:41:22,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:22,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:22,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:22,097 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 17:41:22,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:22,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:22,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:22,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:22,098 INFO L87 Difference]: Start difference. First operand 6439 states and 14285 transitions. Second operand 6 states. [2018-12-09 17:41:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:22,211 INFO L93 Difference]: Finished difference Result 7393 states and 16150 transitions. [2018-12-09 17:41:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:41:22,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 17:41:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:22,216 INFO L225 Difference]: With dead ends: 7393 [2018-12-09 17:41:22,216 INFO L226 Difference]: Without dead ends: 7362 [2018-12-09 17:41:22,216 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 17:41:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2018-12-09 17:41:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 6492. [2018-12-09 17:41:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6492 states. [2018-12-09 17:41:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6492 states to 6492 states and 14216 transitions. [2018-12-09 17:41:22,268 INFO L78 Accepts]: Start accepts. Automaton has 6492 states and 14216 transitions. Word has length 97 [2018-12-09 17:41:22,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:22,268 INFO L480 AbstractCegarLoop]: Abstraction has 6492 states and 14216 transitions. [2018-12-09 17:41:22,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:22,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6492 states and 14216 transitions. [2018-12-09 17:41:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:22,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:22,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, 1, 1, 1, 1] [2018-12-09 17:41:22,273 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:22,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -439969543, now seen corresponding path program 1 times [2018-12-09 17:41:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:22,307 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 17:41:22,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:22,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:41:22,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:22,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:41:22,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:41:22,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:41:22,308 INFO L87 Difference]: Start difference. First operand 6492 states and 14216 transitions. Second operand 5 states. [2018-12-09 17:41:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:22,423 INFO L93 Difference]: Finished difference Result 7692 states and 16739 transitions. [2018-12-09 17:41:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:41:22,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 17:41:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:22,427 INFO L225 Difference]: With dead ends: 7692 [2018-12-09 17:41:22,428 INFO L226 Difference]: Without dead ends: 7605 [2018-12-09 17:41:22,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 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 17:41:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2018-12-09 17:41:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6147. [2018-12-09 17:41:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-12-09 17:41:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 13534 transitions. [2018-12-09 17:41:22,474 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 13534 transitions. Word has length 97 [2018-12-09 17:41:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:22,475 INFO L480 AbstractCegarLoop]: Abstraction has 6147 states and 13534 transitions. [2018-12-09 17:41:22,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:41:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 13534 transitions. [2018-12-09 17:41:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:22,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:22,479 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, 1, 1] [2018-12-09 17:41:22,479 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:22,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1423115111, now seen corresponding path program 2 times [2018-12-09 17:41:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:22,564 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 17:41:22,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:22,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:41:22,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:22,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:41:22,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:41:22,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:41:22,565 INFO L87 Difference]: Start difference. First operand 6147 states and 13534 transitions. Second operand 9 states. [2018-12-09 17:41:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:22,879 INFO L93 Difference]: Finished difference Result 6889 states and 15104 transitions. [2018-12-09 17:41:22,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:41:22,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-12-09 17:41:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:22,884 INFO L225 Difference]: With dead ends: 6889 [2018-12-09 17:41:22,884 INFO L226 Difference]: Without dead ends: 6882 [2018-12-09 17:41:22,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:41:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2018-12-09 17:41:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6286. [2018-12-09 17:41:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6286 states. [2018-12-09 17:41:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 13832 transitions. [2018-12-09 17:41:22,931 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 13832 transitions. Word has length 97 [2018-12-09 17:41:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:22,931 INFO L480 AbstractCegarLoop]: Abstraction has 6286 states and 13832 transitions. [2018-12-09 17:41:22,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:41:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 13832 transitions. [2018-12-09 17:41:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:22,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:22,935 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, 1, 1] [2018-12-09 17:41:22,935 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:22,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1211764198, now seen corresponding path program 1 times [2018-12-09 17:41:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:41:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:22,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:22,983 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 17:41:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:41:22,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:22,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:41:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:41:22,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:41:22,984 INFO L87 Difference]: Start difference. First operand 6286 states and 13832 transitions. Second operand 6 states. [2018-12-09 17:41:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:23,108 INFO L93 Difference]: Finished difference Result 6559 states and 14367 transitions. [2018-12-09 17:41:23,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:41:23,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 17:41:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:23,113 INFO L225 Difference]: With dead ends: 6559 [2018-12-09 17:41:23,113 INFO L226 Difference]: Without dead ends: 6559 [2018-12-09 17:41:23,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:41:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6559 states. [2018-12-09 17:41:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6559 to 6108. [2018-12-09 17:41:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2018-12-09 17:41:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 13426 transitions. [2018-12-09 17:41:23,169 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 13426 transitions. Word has length 97 [2018-12-09 17:41:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:23,170 INFO L480 AbstractCegarLoop]: Abstraction has 6108 states and 13426 transitions. [2018-12-09 17:41:23,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:41:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 13426 transitions. [2018-12-09 17:41:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:23,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:23,175 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, 1, 1] [2018-12-09 17:41:23,175 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:23,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1915558852, now seen corresponding path program 2 times [2018-12-09 17:41:23,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:23,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:41:23,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:23,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:41:23,258 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 17:41:23,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:41:23,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:41:23,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:41:23,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:41:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:41:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:41:23,258 INFO L87 Difference]: Start difference. First operand 6108 states and 13426 transitions. Second operand 8 states. [2018-12-09 17:41:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:41:23,472 INFO L93 Difference]: Finished difference Result 7714 states and 16755 transitions. [2018-12-09 17:41:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:41:23,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-12-09 17:41:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:41:23,477 INFO L225 Difference]: With dead ends: 7714 [2018-12-09 17:41:23,477 INFO L226 Difference]: Without dead ends: 7714 [2018-12-09 17:41:23,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-09 17:41:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7714 states. [2018-12-09 17:41:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7714 to 6218. [2018-12-09 17:41:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2018-12-09 17:41:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 13681 transitions. [2018-12-09 17:41:23,523 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 13681 transitions. Word has length 97 [2018-12-09 17:41:23,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:41:23,524 INFO L480 AbstractCegarLoop]: Abstraction has 6218 states and 13681 transitions. [2018-12-09 17:41:23,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:41:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 13681 transitions. [2018-12-09 17:41:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 17:41:23,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:41:23,528 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, 1, 1] [2018-12-09 17:41:23,528 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:41:23,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:41:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1704207939, now seen corresponding path program 2 times [2018-12-09 17:41:23,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:41:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:23,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:41:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:41:23,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:41:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:41:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:41:23,564 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 17:41:23,636 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 17:41:23,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:41:23 BasicIcfg [2018-12-09 17:41:23,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:41:23,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:41:23,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:41:23,637 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:41:23,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:41:09" (3/4) ... [2018-12-09 17:41:23,639 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 17:41:23,733 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_41892815-cb19-4e98-9501-c89379fabb91/bin-2019/utaipan/witness.graphml [2018-12-09 17:41:23,733 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:41:23,734 INFO L168 Benchmark]: Toolchain (without parser) took 15381.44 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 945.9 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,735 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:41:23,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.74 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,736 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:41:23,736 INFO L168 Benchmark]: RCFGBuilder took 334.51 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,736 INFO L168 Benchmark]: TraceAbstraction took 14581.32 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 668.4 MB in the end (delta: 384.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,736 INFO L168 Benchmark]: Witness Printer took 95.82 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 43.5 MB). Free memory was 668.4 MB in the beginning and 2.3 GB in the end (delta: -1.6 GB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:41:23,738 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.74 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: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 334.51 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14581.32 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 668.4 MB in the end (delta: 384.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 95.82 ms. Allocated memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 43.5 MB). Free memory was 668.4 MB in the beginning and 2.3 GB in the end (delta: -1.6 GB). 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L686] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L687] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L688] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L690] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L692] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0] [L693] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L694] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L695] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L696] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L697] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L698] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L699] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L700] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L701] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L780] -1 pthread_t t911; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L781] FCALL, FORK -1 pthread_create(&t911, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L705] 0 z$w_buff1 = z$w_buff0 [L706] 0 z$w_buff0 = 1 [L707] 0 z$w_buff1_used = z$w_buff0_used [L708] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L710] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L711] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L712] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L713] 0 z$r_buff0_thd1 = (_Bool)1 [L716] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] -1 pthread_t t912; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] FCALL, FORK -1 pthread_create(&t912, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L733] 1 x = 1 [L736] 1 y = 1 [L739] 1 __unbuffered_p1_EAX = y [L742] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L743] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L744] 1 z$flush_delayed = weak$$choice2 [L745] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L746] EXPR 1 !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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L746] 1 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) [L747] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L747] 1 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)) [L748] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L748] 1 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)) [L749] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L749] 1 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)) [L750] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L750] 1 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)) [L751] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] 1 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)) [L752] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, 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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L752] 1 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)) [L753] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L719] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L720] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L721] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L722] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L722] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L723] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L723] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L726] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] 1 z = z$flush_delayed ? z$mem_tmp : z [L755] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L758] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L789] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L789] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L789] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L789] -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) [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L790] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L791] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L791] -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 [L792] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L792] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L793] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L793] -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 [L796] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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 5 procedures, 224 locations, 3 error locations. UNSAFE Result, 14.4s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7951 SDtfs, 8807 SDslu, 18370 SDs, 0 SdLazy, 7683 SolverSat, 362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 72 SyntacticMatches, 33 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34808occurred in iteration=0, 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: 3.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 63403 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2274 NumberOfCodeBlocks, 2274 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2148 ConstructedInterpolants, 0 QuantifiedInterpolants, 449634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...