./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.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_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/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 424d85e81579c93fea3149876316172742bff15d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 00:37:23,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:37:23,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:37:23,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:37:23,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:37:23,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:37:23,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:37:23,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:37:23,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:37:23,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:37:23,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:37:23,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:37:23,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:37:23,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:37:23,724 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:37:23,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:37:23,725 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:37:23,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:37:23,727 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:37:23,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:37:23,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:37:23,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:37:23,729 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:37:23,729 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:37:23,729 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:37:23,730 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:37:23,730 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:37:23,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:37:23,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:37:23,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:37:23,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:37:23,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:37:23,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:37:23,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:37:23,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:37:23,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:37:23,733 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 00:37:23,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:37:23,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:37:23,741 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 00:37:23,741 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 00:37:23,741 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 00:37:23,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:37:23,742 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:37:23,743 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:37:23,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:37:23,743 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:37:23,744 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 00:37:23,744 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:37:23,744 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:37:23,744 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 00:37:23,744 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_4c4c389f-b5dc-4d02-ad08-9580e0065700/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 -> 424d85e81579c93fea3149876316172742bff15d [2018-12-02 00:37:23,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:37:23,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:37:23,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:37:23,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:37:23,770 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:37:23,770 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-02 00:37:23,804 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/data/214fddad0/11bd3de9a88d400ca690b09f1b6594c5/FLAG9c82e4f3c [2018-12-02 00:37:24,140 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:37:24,141 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-02 00:37:24,149 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/data/214fddad0/11bd3de9a88d400ca690b09f1b6594c5/FLAG9c82e4f3c [2018-12-02 00:37:24,530 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/data/214fddad0/11bd3de9a88d400ca690b09f1b6594c5 [2018-12-02 00:37:24,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:37:24,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:37:24,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:37:24,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:37:24,536 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:37:24,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c0526c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24, skipping insertion in model container [2018-12-02 00:37:24,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:37:24,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:37:24,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:37:24,745 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:37:24,816 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:37:24,855 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:37:24,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24 WrapperNode [2018-12-02 00:37:24,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:37:24,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:37:24,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:37:24,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:37:24,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:37:24,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:37:24,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:37:24,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:37:24,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... [2018-12-02 00:37:24,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:37:24,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:37:24,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:37:24,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:37:24,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/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-02 00:37:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 00:37:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 00:37:24,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 00:37:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:37:24,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:37:24,956 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 00:37:25,275 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:37:25,275 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 00:37:25,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:25 BoogieIcfgContainer [2018-12-02 00:37:25,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:37:25,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:37:25,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:37:25,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:37:25,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:37:24" (1/3) ... [2018-12-02 00:37:25,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:25, skipping insertion in model container [2018-12-02 00:37:25,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:37:24" (2/3) ... [2018-12-02 00:37:25,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:37:25, skipping insertion in model container [2018-12-02 00:37:25,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:25" (3/3) ... [2018-12-02 00:37:25,280 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_false-unreach-call.i [2018-12-02 00:37:25,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,303 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,303 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,304 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,305 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,306 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,307 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,308 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,310 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,311 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,312 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,313 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,314 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,315 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,316 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,317 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,318 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,319 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:37:25,323 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 00:37:25,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:37:25,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 00:37:25,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 00:37:25,354 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:37:25,355 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:37:25,355 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:37:25,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:37:25,355 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:37:25,355 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:37:25,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:37:25,355 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:37:25,362 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 00:37:26,846 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 00:37:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 00:37:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 00:37:26,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:26,853 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] [2018-12-02 00:37:26,855 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:26,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-02 00:37:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:26,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:26,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:27,006 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-02 00:37:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:27,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:27,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:27,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:27,020 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 00:37:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:27,493 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 00:37:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:37:27,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 00:37:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:27,635 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 00:37:27,635 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 00:37:27,636 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-02 00:37:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 00:37:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 00:37:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 00:37:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 00:37:28,375 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 00:37:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 00:37:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 00:37:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 00:37:28,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:28,380 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] [2018-12-02 00:37:28,381 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:28,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-02 00:37:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:28,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:28,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:28,431 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-02 00:37:28,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:28,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:28,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:28,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:28,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:28,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:28,434 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 4 states. [2018-12-02 00:37:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:28,509 INFO L93 Difference]: Finished difference Result 8529 states and 28345 transitions. [2018-12-02 00:37:28,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:37:28,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 00:37:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:28,524 INFO L225 Difference]: With dead ends: 8529 [2018-12-02 00:37:28,524 INFO L226 Difference]: Without dead ends: 7467 [2018-12-02 00:37:28,524 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-02 00:37:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-12-02 00:37:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-12-02 00:37:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-12-02 00:37:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24637 transitions. [2018-12-02 00:37:28,610 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24637 transitions. Word has length 46 [2018-12-02 00:37:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:28,610 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24637 transitions. [2018-12-02 00:37:28,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24637 transitions. [2018-12-02 00:37:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 00:37:28,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:28,611 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-02 00:37:28,611 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:28,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-02 00:37:28,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:28,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:28,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:28,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:28,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:28,657 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-02 00:37:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:28,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:28,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:28,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:28,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:28,658 INFO L87 Difference]: Start difference. First operand 7467 states and 24637 transitions. Second operand 5 states. [2018-12-02 00:37:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:28,865 INFO L93 Difference]: Finished difference Result 13999 states and 45806 transitions. [2018-12-02 00:37:28,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:28,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 00:37:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:28,896 INFO L225 Difference]: With dead ends: 13999 [2018-12-02 00:37:28,897 INFO L226 Difference]: Without dead ends: 13931 [2018-12-02 00:37:28,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-12-02 00:37:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-12-02 00:37:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-12-02 00:37:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30543 transitions. [2018-12-02 00:37:29,087 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30543 transitions. Word has length 47 [2018-12-02 00:37:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:29,088 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30543 transitions. [2018-12-02 00:37:29,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30543 transitions. [2018-12-02 00:37:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 00:37:29,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:29,089 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] [2018-12-02 00:37:29,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:29,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-02 00:37:29,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:29,112 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-02 00:37:29,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:37:29,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:29,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:37:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:37:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:37:29,114 INFO L87 Difference]: Start difference. First operand 9442 states and 30543 transitions. Second operand 3 states. [2018-12-02 00:37:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:29,177 INFO L93 Difference]: Finished difference Result 13280 states and 42642 transitions. [2018-12-02 00:37:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:37:29,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 00:37:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:29,194 INFO L225 Difference]: With dead ends: 13280 [2018-12-02 00:37:29,194 INFO L226 Difference]: Without dead ends: 13280 [2018-12-02 00:37:29,194 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-02 00:37:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-12-02 00:37:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-12-02 00:37:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-12-02 00:37:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31509 transitions. [2018-12-02 00:37:29,317 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31509 transitions. Word has length 49 [2018-12-02 00:37:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:29,317 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31509 transitions. [2018-12-02 00:37:29,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:37:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31509 transitions. [2018-12-02 00:37:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 00:37:29,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:29,319 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] [2018-12-02 00:37:29,319 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:29,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-02 00:37:29,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:29,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:29,374 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-02 00:37:29,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:29,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:29,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:29,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:29,376 INFO L87 Difference]: Start difference. First operand 9846 states and 31509 transitions. Second operand 6 states. [2018-12-02 00:37:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:29,625 INFO L93 Difference]: Finished difference Result 14204 states and 45065 transitions. [2018-12-02 00:37:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:29,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 00:37:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:29,641 INFO L225 Difference]: With dead ends: 14204 [2018-12-02 00:37:29,641 INFO L226 Difference]: Without dead ends: 14132 [2018-12-02 00:37:29,642 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-02 00:37:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-12-02 00:37:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-12-02 00:37:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-12-02 00:37:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34564 transitions. [2018-12-02 00:37:29,770 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34564 transitions. Word has length 53 [2018-12-02 00:37:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:29,771 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34564 transitions. [2018-12-02 00:37:29,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34564 transitions. [2018-12-02 00:37:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 00:37:29,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:29,776 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] [2018-12-02 00:37:29,776 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:29,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-02 00:37:29,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:29,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:29,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:29,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:29,828 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-02 00:37:29,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:29,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:29,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:29,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:29,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:29,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:29,828 INFO L87 Difference]: Start difference. First operand 10850 states and 34564 transitions. Second operand 4 states. [2018-12-02 00:37:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:29,908 INFO L93 Difference]: Finished difference Result 12397 states and 39573 transitions. [2018-12-02 00:37:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:37:29,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 00:37:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:29,922 INFO L225 Difference]: With dead ends: 12397 [2018-12-02 00:37:29,922 INFO L226 Difference]: Without dead ends: 12397 [2018-12-02 00:37:29,922 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-02 00:37:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-12-02 00:37:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-12-02 00:37:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-12-02 00:37:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36237 transitions. [2018-12-02 00:37:30,077 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36237 transitions. Word has length 61 [2018-12-02 00:37:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:30,077 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36237 transitions. [2018-12-02 00:37:30,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36237 transitions. [2018-12-02 00:37:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 00:37:30,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:30,081 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] [2018-12-02 00:37:30,081 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:30,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-02 00:37:30,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:30,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:30,124 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-02 00:37:30,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:30,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:30,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:30,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:30,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:30,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:30,125 INFO L87 Difference]: Start difference. First operand 11370 states and 36237 transitions. Second operand 6 states. [2018-12-02 00:37:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:30,387 INFO L93 Difference]: Finished difference Result 20970 states and 66487 transitions. [2018-12-02 00:37:30,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:30,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 00:37:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:30,410 INFO L225 Difference]: With dead ends: 20970 [2018-12-02 00:37:30,411 INFO L226 Difference]: Without dead ends: 20899 [2018-12-02 00:37:30,411 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-02 00:37:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-12-02 00:37:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-12-02 00:37:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-02 00:37:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43281 transitions. [2018-12-02 00:37:30,593 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43281 transitions. Word has length 61 [2018-12-02 00:37:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43281 transitions. [2018-12-02 00:37:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43281 transitions. [2018-12-02 00:37:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 00:37:30,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:30,598 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] [2018-12-02 00:37:30,598 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:30,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1525104999, now seen corresponding path program 1 times [2018-12-02 00:37:30,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:30,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:30,620 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-02 00:37:30,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:30,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:37:30,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:30,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:37:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:37:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:37:30,621 INFO L87 Difference]: Start difference. First operand 13756 states and 43281 transitions. Second operand 3 states. [2018-12-02 00:37:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:30,756 INFO L93 Difference]: Finished difference Result 14388 states and 44981 transitions. [2018-12-02 00:37:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:37:30,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 00:37:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:30,772 INFO L225 Difference]: With dead ends: 14388 [2018-12-02 00:37:30,773 INFO L226 Difference]: Without dead ends: 14388 [2018-12-02 00:37:30,773 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-02 00:37:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-12-02 00:37:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-12-02 00:37:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-02 00:37:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44131 transitions. [2018-12-02 00:37:30,923 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44131 transitions. Word has length 65 [2018-12-02 00:37:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:30,923 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44131 transitions. [2018-12-02 00:37:30,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:37:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44131 transitions. [2018-12-02 00:37:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 00:37:30,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:30,927 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] [2018-12-02 00:37:30,927 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:30,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash 905557400, now seen corresponding path program 1 times [2018-12-02 00:37:30,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:30,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:30,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:30,982 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-02 00:37:30,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:30,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:30,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:30,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:30,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:30,984 INFO L87 Difference]: Start difference. First operand 14072 states and 44131 transitions. Second operand 4 states. [2018-12-02 00:37:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:31,212 INFO L93 Difference]: Finished difference Result 17952 states and 55436 transitions. [2018-12-02 00:37:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:37:31,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 00:37:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:31,232 INFO L225 Difference]: With dead ends: 17952 [2018-12-02 00:37:31,232 INFO L226 Difference]: Without dead ends: 17952 [2018-12-02 00:37:31,233 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-02 00:37:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-12-02 00:37:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-12-02 00:37:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-12-02 00:37:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49982 transitions. [2018-12-02 00:37:31,440 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49982 transitions. Word has length 65 [2018-12-02 00:37:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:31,440 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49982 transitions. [2018-12-02 00:37:31,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49982 transitions. [2018-12-02 00:37:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:31,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:31,447 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] [2018-12-02 00:37:31,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:31,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -987757598, now seen corresponding path program 1 times [2018-12-02 00:37:31,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:31,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:31,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:31,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:31,553 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-02 00:37:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:31,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:31,553 INFO L87 Difference]: Start difference. First operand 16110 states and 49982 transitions. Second operand 6 states. [2018-12-02 00:37:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:32,125 INFO L93 Difference]: Finished difference Result 19822 states and 60438 transitions. [2018-12-02 00:37:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:32,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 00:37:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:32,145 INFO L225 Difference]: With dead ends: 19822 [2018-12-02 00:37:32,145 INFO L226 Difference]: Without dead ends: 19822 [2018-12-02 00:37:32,146 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-02 00:37:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-12-02 00:37:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-12-02 00:37:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-12-02 00:37:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57218 transitions. [2018-12-02 00:37:32,344 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57218 transitions. Word has length 67 [2018-12-02 00:37:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:32,345 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57218 transitions. [2018-12-02 00:37:32,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57218 transitions. [2018-12-02 00:37:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:32,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:32,352 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] [2018-12-02 00:37:32,352 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:32,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1230000355, now seen corresponding path program 1 times [2018-12-02 00:37:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:32,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:32,430 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-02 00:37:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:32,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:32,430 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:32,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:32,430 INFO L87 Difference]: Start difference. First operand 18618 states and 57218 transitions. Second operand 6 states. [2018-12-02 00:37:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:32,704 INFO L93 Difference]: Finished difference Result 21450 states and 63627 transitions. [2018-12-02 00:37:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:37:32,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 00:37:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:32,727 INFO L225 Difference]: With dead ends: 21450 [2018-12-02 00:37:32,727 INFO L226 Difference]: Without dead ends: 21450 [2018-12-02 00:37:32,727 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-02 00:37:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-12-02 00:37:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-12-02 00:37:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-12-02 00:37:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57765 transitions. [2018-12-02 00:37:32,933 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57765 transitions. Word has length 67 [2018-12-02 00:37:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:32,933 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57765 transitions. [2018-12-02 00:37:32,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57765 transitions. [2018-12-02 00:37:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:32,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:32,941 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] [2018-12-02 00:37:32,941 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:32,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:32,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1441351268, now seen corresponding path program 1 times [2018-12-02 00:37:32,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:32,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:32,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:32,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:33,003 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-02 00:37:33,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:33,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:33,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:33,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:33,003 INFO L87 Difference]: Start difference. First operand 19134 states and 57765 transitions. Second operand 5 states. [2018-12-02 00:37:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:33,242 INFO L93 Difference]: Finished difference Result 25025 states and 75019 transitions. [2018-12-02 00:37:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:33,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 00:37:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:33,270 INFO L225 Difference]: With dead ends: 25025 [2018-12-02 00:37:33,270 INFO L226 Difference]: Without dead ends: 25025 [2018-12-02 00:37:33,270 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-02 00:37:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-12-02 00:37:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-12-02 00:37:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-12-02 00:37:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68033 transitions. [2018-12-02 00:37:33,537 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68033 transitions. Word has length 67 [2018-12-02 00:37:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:33,537 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 68033 transitions. [2018-12-02 00:37:33,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68033 transitions. [2018-12-02 00:37:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:33,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:33,544 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] [2018-12-02 00:37:33,544 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:33,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash 930817091, now seen corresponding path program 1 times [2018-12-02 00:37:33,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:33,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:33,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:33,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:33,576 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-02 00:37:33,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:33,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:33,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:33,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:33,578 INFO L87 Difference]: Start difference. First operand 22710 states and 68033 transitions. Second operand 5 states. [2018-12-02 00:37:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:33,895 INFO L93 Difference]: Finished difference Result 31960 states and 94872 transitions. [2018-12-02 00:37:33,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:37:33,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 00:37:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:33,932 INFO L225 Difference]: With dead ends: 31960 [2018-12-02 00:37:33,932 INFO L226 Difference]: Without dead ends: 31960 [2018-12-02 00:37:33,932 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-02 00:37:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-12-02 00:37:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-12-02 00:37:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-12-02 00:37:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84260 transitions. [2018-12-02 00:37:34,258 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84260 transitions. Word has length 67 [2018-12-02 00:37:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:34,259 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84260 transitions. [2018-12-02 00:37:34,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84260 transitions. [2018-12-02 00:37:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:34,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:34,272 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] [2018-12-02 00:37:34,272 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:34,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -876637372, now seen corresponding path program 1 times [2018-12-02 00:37:34,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:34,322 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-02 00:37:34,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:34,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:34,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:34,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:34,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:34,323 INFO L87 Difference]: Start difference. First operand 28240 states and 84260 transitions. Second operand 5 states. [2018-12-02 00:37:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:34,369 INFO L93 Difference]: Finished difference Result 9044 states and 21835 transitions. [2018-12-02 00:37:34,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:37:34,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 00:37:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:34,374 INFO L225 Difference]: With dead ends: 9044 [2018-12-02 00:37:34,374 INFO L226 Difference]: Without dead ends: 7192 [2018-12-02 00:37:34,374 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-02 00:37:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2018-12-02 00:37:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 6089. [2018-12-02 00:37:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2018-12-02 00:37:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 14306 transitions. [2018-12-02 00:37:34,422 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 14306 transitions. Word has length 67 [2018-12-02 00:37:34,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:34,422 INFO L480 AbstractCegarLoop]: Abstraction has 6089 states and 14306 transitions. [2018-12-02 00:37:34,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 14306 transitions. [2018-12-02 00:37:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 00:37:34,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:34,426 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] [2018-12-02 00:37:34,426 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:34,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:34,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-02 00:37:34,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:34,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:34,441 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-02 00:37:34,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:37:34,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:37:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:37:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:37:34,441 INFO L87 Difference]: Start difference. First operand 6089 states and 14306 transitions. Second operand 3 states. [2018-12-02 00:37:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:34,472 INFO L93 Difference]: Finished difference Result 8276 states and 19333 transitions. [2018-12-02 00:37:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:37:34,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 00:37:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:34,478 INFO L225 Difference]: With dead ends: 8276 [2018-12-02 00:37:34,478 INFO L226 Difference]: Without dead ends: 8276 [2018-12-02 00:37:34,479 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-02 00:37:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2018-12-02 00:37:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6028. [2018-12-02 00:37:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6028 states. [2018-12-02 00:37:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 13846 transitions. [2018-12-02 00:37:34,528 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 13846 transitions. Word has length 67 [2018-12-02 00:37:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:34,528 INFO L480 AbstractCegarLoop]: Abstraction has 6028 states and 13846 transitions. [2018-12-02 00:37:34,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:37:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 13846 transitions. [2018-12-02 00:37:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 00:37:34,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:34,533 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] [2018-12-02 00:37:34,533 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:34,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-02 00:37:34,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:34,569 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-02 00:37:34,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:34,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:34,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:34,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:34,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:34,570 INFO L87 Difference]: Start difference. First operand 6028 states and 13846 transitions. Second operand 5 states. [2018-12-02 00:37:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:34,676 INFO L93 Difference]: Finished difference Result 7198 states and 16487 transitions. [2018-12-02 00:37:34,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:37:34,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 00:37:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:34,681 INFO L225 Difference]: With dead ends: 7198 [2018-12-02 00:37:34,681 INFO L226 Difference]: Without dead ends: 7198 [2018-12-02 00:37:34,681 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-02 00:37:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2018-12-02 00:37:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 6472. [2018-12-02 00:37:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2018-12-02 00:37:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 14850 transitions. [2018-12-02 00:37:34,728 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 14850 transitions. Word has length 73 [2018-12-02 00:37:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:34,728 INFO L480 AbstractCegarLoop]: Abstraction has 6472 states and 14850 transitions. [2018-12-02 00:37:34,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 14850 transitions. [2018-12-02 00:37:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 00:37:34,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:34,732 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] [2018-12-02 00:37:34,733 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:34,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-02 00:37:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:34,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:34,771 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-02 00:37:34,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:34,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:37:34,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:34,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:37:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:37:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:34,772 INFO L87 Difference]: Start difference. First operand 6472 states and 14850 transitions. Second operand 7 states. [2018-12-02 00:37:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:35,027 INFO L93 Difference]: Finished difference Result 7545 states and 17112 transitions. [2018-12-02 00:37:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:37:35,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 00:37:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:35,033 INFO L225 Difference]: With dead ends: 7545 [2018-12-02 00:37:35,033 INFO L226 Difference]: Without dead ends: 7426 [2018-12-02 00:37:35,034 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-02 00:37:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2018-12-02 00:37:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6569. [2018-12-02 00:37:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2018-12-02 00:37:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14943 transitions. [2018-12-02 00:37:35,085 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14943 transitions. Word has length 73 [2018-12-02 00:37:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:35,085 INFO L480 AbstractCegarLoop]: Abstraction has 6569 states and 14943 transitions. [2018-12-02 00:37:35,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:37:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14943 transitions. [2018-12-02 00:37:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 00:37:35,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:35,090 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] [2018-12-02 00:37:35,091 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1900952980, now seen corresponding path program 1 times [2018-12-02 00:37:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:35,120 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-02 00:37:35,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:35,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:35,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:35,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:35,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:35,121 INFO L87 Difference]: Start difference. First operand 6569 states and 14943 transitions. Second operand 4 states. [2018-12-02 00:37:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:35,284 INFO L93 Difference]: Finished difference Result 10256 states and 23214 transitions. [2018-12-02 00:37:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:37:35,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 00:37:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:35,291 INFO L225 Difference]: With dead ends: 10256 [2018-12-02 00:37:35,291 INFO L226 Difference]: Without dead ends: 10256 [2018-12-02 00:37:35,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:35,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10256 states. [2018-12-02 00:37:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10256 to 7689. [2018-12-02 00:37:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-12-02 00:37:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 17277 transitions. [2018-12-02 00:37:35,391 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 17277 transitions. Word has length 92 [2018-12-02 00:37:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:35,391 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 17277 transitions. [2018-12-02 00:37:35,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 17277 transitions. [2018-12-02 00:37:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 00:37:35,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:35,396 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] [2018-12-02 00:37:35,397 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:35,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:35,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1742447813, now seen corresponding path program 1 times [2018-12-02 00:37:35,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:35,429 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-02 00:37:35,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:37:35,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:37:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:37:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:37:35,429 INFO L87 Difference]: Start difference. First operand 7689 states and 17277 transitions. Second operand 4 states. [2018-12-02 00:37:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:35,496 INFO L93 Difference]: Finished difference Result 8254 states and 18570 transitions. [2018-12-02 00:37:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:37:35,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 00:37:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:35,501 INFO L225 Difference]: With dead ends: 8254 [2018-12-02 00:37:35,501 INFO L226 Difference]: Without dead ends: 8254 [2018-12-02 00:37:35,501 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-02 00:37:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2018-12-02 00:37:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 7595. [2018-12-02 00:37:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2018-12-02 00:37:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 17172 transitions. [2018-12-02 00:37:35,556 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 17172 transitions. Word has length 92 [2018-12-02 00:37:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:35,557 INFO L480 AbstractCegarLoop]: Abstraction has 7595 states and 17172 transitions. [2018-12-02 00:37:35,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:37:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 17172 transitions. [2018-12-02 00:37:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:35,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:35,562 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] [2018-12-02 00:37:35,562 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:35,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1344279218, now seen corresponding path program 1 times [2018-12-02 00:37:35,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:35,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:35,594 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-02 00:37:35,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:35,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:35,594 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:35,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:35,595 INFO L87 Difference]: Start difference. First operand 7595 states and 17172 transitions. Second operand 5 states. [2018-12-02 00:37:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:35,767 INFO L93 Difference]: Finished difference Result 7161 states and 16024 transitions. [2018-12-02 00:37:35,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:37:35,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 00:37:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:35,772 INFO L225 Difference]: With dead ends: 7161 [2018-12-02 00:37:35,772 INFO L226 Difference]: Without dead ends: 7161 [2018-12-02 00:37:35,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2018-12-02 00:37:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 6729. [2018-12-02 00:37:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-02 00:37:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 15087 transitions. [2018-12-02 00:37:35,820 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 15087 transitions. Word has length 94 [2018-12-02 00:37:35,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:35,820 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 15087 transitions. [2018-12-02 00:37:35,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 15087 transitions. [2018-12-02 00:37:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:35,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:35,825 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] [2018-12-02 00:37:35,825 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:35,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 895526994, now seen corresponding path program 1 times [2018-12-02 00:37:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:35,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:35,894 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-02 00:37:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 00:37:35,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:35,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:37:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:37:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:37:35,895 INFO L87 Difference]: Start difference. First operand 6729 states and 15087 transitions. Second operand 9 states. [2018-12-02 00:37:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:37,406 INFO L93 Difference]: Finished difference Result 18608 states and 41582 transitions. [2018-12-02 00:37:37,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 00:37:37,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 00:37:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:37,418 INFO L225 Difference]: With dead ends: 18608 [2018-12-02 00:37:37,419 INFO L226 Difference]: Without dead ends: 18489 [2018-12-02 00:37:37,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 00:37:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18489 states. [2018-12-02 00:37:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18489 to 10135. [2018-12-02 00:37:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10135 states. [2018-12-02 00:37:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10135 states to 10135 states and 22963 transitions. [2018-12-02 00:37:37,530 INFO L78 Accepts]: Start accepts. Automaton has 10135 states and 22963 transitions. Word has length 94 [2018-12-02 00:37:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 10135 states and 22963 transitions. [2018-12-02 00:37:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:37:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 10135 states and 22963 transitions. [2018-12-02 00:37:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:37,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:37,538 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] [2018-12-02 00:37:37,538 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:37,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2140291475, now seen corresponding path program 1 times [2018-12-02 00:37:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:37,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:37,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:37,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:37,612 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-02 00:37:37,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:37,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:37,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:37,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:37,613 INFO L87 Difference]: Start difference. First operand 10135 states and 22963 transitions. Second operand 6 states. [2018-12-02 00:37:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:37,764 INFO L93 Difference]: Finished difference Result 10824 states and 23975 transitions. [2018-12-02 00:37:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:37,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 00:37:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:37,772 INFO L225 Difference]: With dead ends: 10824 [2018-12-02 00:37:37,772 INFO L226 Difference]: Without dead ends: 10784 [2018-12-02 00:37:37,772 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-02 00:37:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10784 states. [2018-12-02 00:37:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10784 to 9254. [2018-12-02 00:37:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9254 states. [2018-12-02 00:37:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9254 states to 9254 states and 20685 transitions. [2018-12-02 00:37:37,846 INFO L78 Accepts]: Start accepts. Automaton has 9254 states and 20685 transitions. Word has length 94 [2018-12-02 00:37:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:37,846 INFO L480 AbstractCegarLoop]: Abstraction has 9254 states and 20685 transitions. [2018-12-02 00:37:37,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9254 states and 20685 transitions. [2018-12-02 00:37:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:37,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:37,854 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] [2018-12-02 00:37:37,854 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:37,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -538468846, now seen corresponding path program 1 times [2018-12-02 00:37:37,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:37,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:37,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:37,900 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-02 00:37:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:37,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:37,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:37,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:37,901 INFO L87 Difference]: Start difference. First operand 9254 states and 20685 transitions. Second operand 5 states. [2018-12-02 00:37:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:38,129 INFO L93 Difference]: Finished difference Result 11461 states and 25404 transitions. [2018-12-02 00:37:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:37:38,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 00:37:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:38,137 INFO L225 Difference]: With dead ends: 11461 [2018-12-02 00:37:38,137 INFO L226 Difference]: Without dead ends: 11281 [2018-12-02 00:37:38,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11281 states. [2018-12-02 00:37:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11281 to 10087. [2018-12-02 00:37:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10087 states. [2018-12-02 00:37:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10087 states to 10087 states and 22479 transitions. [2018-12-02 00:37:38,220 INFO L78 Accepts]: Start accepts. Automaton has 10087 states and 22479 transitions. Word has length 94 [2018-12-02 00:37:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:38,220 INFO L480 AbstractCegarLoop]: Abstraction has 10087 states and 22479 transitions. [2018-12-02 00:37:38,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10087 states and 22479 transitions. [2018-12-02 00:37:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:38,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:38,228 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] [2018-12-02 00:37:38,228 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:38,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:38,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1679289107, now seen corresponding path program 1 times [2018-12-02 00:37:38,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:38,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:38,263 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-02 00:37:38,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:38,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:38,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:38,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:38,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:38,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:38,264 INFO L87 Difference]: Start difference. First operand 10087 states and 22479 transitions. Second operand 5 states. [2018-12-02 00:37:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:38,418 INFO L93 Difference]: Finished difference Result 12605 states and 27883 transitions. [2018-12-02 00:37:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:37:38,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 00:37:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:38,427 INFO L225 Difference]: With dead ends: 12605 [2018-12-02 00:37:38,427 INFO L226 Difference]: Without dead ends: 12472 [2018-12-02 00:37:38,427 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-02 00:37:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12472 states. [2018-12-02 00:37:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12472 to 10252. [2018-12-02 00:37:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10252 states. [2018-12-02 00:37:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10252 states to 10252 states and 22817 transitions. [2018-12-02 00:37:38,529 INFO L78 Accepts]: Start accepts. Automaton has 10252 states and 22817 transitions. Word has length 94 [2018-12-02 00:37:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:38,529 INFO L480 AbstractCegarLoop]: Abstraction has 10252 states and 22817 transitions. [2018-12-02 00:37:38,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 10252 states and 22817 transitions. [2018-12-02 00:37:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:38,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:38,537 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] [2018-12-02 00:37:38,537 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:38,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1759786015, now seen corresponding path program 1 times [2018-12-02 00:37:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:38,571 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-02 00:37:38,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:38,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:38,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:38,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:38,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:38,571 INFO L87 Difference]: Start difference. First operand 10252 states and 22817 transitions. Second operand 5 states. [2018-12-02 00:37:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:38,634 INFO L93 Difference]: Finished difference Result 8291 states and 18451 transitions. [2018-12-02 00:37:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:38,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 00:37:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:38,639 INFO L225 Difference]: With dead ends: 8291 [2018-12-02 00:37:38,640 INFO L226 Difference]: Without dead ends: 8291 [2018-12-02 00:37:38,640 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-02 00:37:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2018-12-02 00:37:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 6696. [2018-12-02 00:37:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6696 states. [2018-12-02 00:37:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6696 states to 6696 states and 15007 transitions. [2018-12-02 00:37:38,690 INFO L78 Accepts]: Start accepts. Automaton has 6696 states and 15007 transitions. Word has length 94 [2018-12-02 00:37:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:38,690 INFO L480 AbstractCegarLoop]: Abstraction has 6696 states and 15007 transitions. [2018-12-02 00:37:38,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6696 states and 15007 transitions. [2018-12-02 00:37:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:38,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:38,695 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] [2018-12-02 00:37:38,695 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:38,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash -809700384, now seen corresponding path program 2 times [2018-12-02 00:37:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:38,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:38,753 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-02 00:37:38,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:38,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:37:38,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:37:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:37:38,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:38,754 INFO L87 Difference]: Start difference. First operand 6696 states and 15007 transitions. Second operand 7 states. [2018-12-02 00:37:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:38,972 INFO L93 Difference]: Finished difference Result 8410 states and 18607 transitions. [2018-12-02 00:37:38,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:38,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 00:37:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:38,977 INFO L225 Difference]: With dead ends: 8410 [2018-12-02 00:37:38,978 INFO L226 Difference]: Without dead ends: 8410 [2018-12-02 00:37:38,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:37:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-12-02 00:37:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6809. [2018-12-02 00:37:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2018-12-02 00:37:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 15246 transitions. [2018-12-02 00:37:39,029 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 15246 transitions. Word has length 94 [2018-12-02 00:37:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:39,029 INFO L480 AbstractCegarLoop]: Abstraction has 6809 states and 15246 transitions. [2018-12-02 00:37:39,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:37:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 15246 transitions. [2018-12-02 00:37:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:39,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:39,033 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] [2018-12-02 00:37:39,033 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:39,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1408057569, now seen corresponding path program 2 times [2018-12-02 00:37:39,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:37:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:39,094 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-02 00:37:39,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:39,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:37:39,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:39,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:37:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:37:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:39,095 INFO L87 Difference]: Start difference. First operand 6809 states and 15246 transitions. Second operand 7 states. [2018-12-02 00:37:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:39,288 INFO L93 Difference]: Finished difference Result 9658 states and 21670 transitions. [2018-12-02 00:37:39,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:39,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 00:37:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:39,295 INFO L225 Difference]: With dead ends: 9658 [2018-12-02 00:37:39,295 INFO L226 Difference]: Without dead ends: 9626 [2018-12-02 00:37:39,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:37:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9626 states. [2018-12-02 00:37:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9626 to 8903. [2018-12-02 00:37:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8903 states. [2018-12-02 00:37:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8903 states to 8903 states and 19928 transitions. [2018-12-02 00:37:39,365 INFO L78 Accepts]: Start accepts. Automaton has 8903 states and 19928 transitions. Word has length 94 [2018-12-02 00:37:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:39,366 INFO L480 AbstractCegarLoop]: Abstraction has 8903 states and 19928 transitions. [2018-12-02 00:37:39,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:37:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8903 states and 19928 transitions. [2018-12-02 00:37:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:39,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:39,372 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] [2018-12-02 00:37:39,372 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:39,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash -388893790, now seen corresponding path program 1 times [2018-12-02 00:37:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:37:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:39,423 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-02 00:37:39,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:39,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:37:39,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:39,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:37:39,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:37:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:39,424 INFO L87 Difference]: Start difference. First operand 8903 states and 19928 transitions. Second operand 8 states. [2018-12-02 00:37:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:39,697 INFO L93 Difference]: Finished difference Result 14507 states and 33306 transitions. [2018-12-02 00:37:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:37:39,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 00:37:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:39,713 INFO L225 Difference]: With dead ends: 14507 [2018-12-02 00:37:39,713 INFO L226 Difference]: Without dead ends: 14507 [2018-12-02 00:37:39,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 00:37:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2018-12-02 00:37:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 9598. [2018-12-02 00:37:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2018-12-02 00:37:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 21764 transitions. [2018-12-02 00:37:39,812 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 21764 transitions. Word has length 94 [2018-12-02 00:37:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:39,812 INFO L480 AbstractCegarLoop]: Abstraction has 9598 states and 21764 transitions. [2018-12-02 00:37:39,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:37:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 21764 transitions. [2018-12-02 00:37:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:39,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:39,819 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] [2018-12-02 00:37:39,819 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:39,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 498609891, now seen corresponding path program 1 times [2018-12-02 00:37:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:39,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:39,891 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-02 00:37:39,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:39,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:37:39,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:39,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:37:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:37:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:39,892 INFO L87 Difference]: Start difference. First operand 9598 states and 21764 transitions. Second operand 8 states. [2018-12-02 00:37:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:40,134 INFO L93 Difference]: Finished difference Result 12244 states and 28003 transitions. [2018-12-02 00:37:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:37:40,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 00:37:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:40,142 INFO L225 Difference]: With dead ends: 12244 [2018-12-02 00:37:40,142 INFO L226 Difference]: Without dead ends: 12244 [2018-12-02 00:37:40,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-12-02 00:37:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12244 states. [2018-12-02 00:37:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12244 to 9948. [2018-12-02 00:37:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9948 states. [2018-12-02 00:37:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9948 states to 9948 states and 22501 transitions. [2018-12-02 00:37:40,219 INFO L78 Accepts]: Start accepts. Automaton has 9948 states and 22501 transitions. Word has length 94 [2018-12-02 00:37:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:40,219 INFO L480 AbstractCegarLoop]: Abstraction has 9948 states and 22501 transitions. [2018-12-02 00:37:40,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:37:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9948 states and 22501 transitions. [2018-12-02 00:37:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 00:37:40,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:40,226 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] [2018-12-02 00:37:40,226 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:40,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1233365661, now seen corresponding path program 1 times [2018-12-02 00:37:40,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:40,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:40,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-02 00:37:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:40,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:40,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:40,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:40,288 INFO L87 Difference]: Start difference. First operand 9948 states and 22501 transitions. Second operand 6 states. [2018-12-02 00:37:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:40,362 INFO L93 Difference]: Finished difference Result 9676 states and 21517 transitions. [2018-12-02 00:37:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:40,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 00:37:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:40,368 INFO L225 Difference]: With dead ends: 9676 [2018-12-02 00:37:40,368 INFO L226 Difference]: Without dead ends: 9676 [2018-12-02 00:37:40,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9676 states. [2018-12-02 00:37:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9676 to 6242. [2018-12-02 00:37:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6242 states. [2018-12-02 00:37:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 13734 transitions. [2018-12-02 00:37:40,429 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 13734 transitions. Word has length 94 [2018-12-02 00:37:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:40,430 INFO L480 AbstractCegarLoop]: Abstraction has 6242 states and 13734 transitions. [2018-12-02 00:37:40,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 13734 transitions. [2018-12-02 00:37:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:40,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:40,433 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] [2018-12-02 00:37:40,433 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:40,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1206757213, now seen corresponding path program 1 times [2018-12-02 00:37:40,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:40,487 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-02 00:37:40,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:40,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:37:40,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:40,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:37:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:37:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:40,488 INFO L87 Difference]: Start difference. First operand 6242 states and 13734 transitions. Second operand 7 states. [2018-12-02 00:37:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:40,653 INFO L93 Difference]: Finished difference Result 7588 states and 16554 transitions. [2018-12-02 00:37:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:40,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 00:37:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:40,658 INFO L225 Difference]: With dead ends: 7588 [2018-12-02 00:37:40,658 INFO L226 Difference]: Without dead ends: 7588 [2018-12-02 00:37:40,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:37:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7588 states. [2018-12-02 00:37:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7588 to 6255. [2018-12-02 00:37:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2018-12-02 00:37:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 13739 transitions. [2018-12-02 00:37:40,705 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 13739 transitions. Word has length 96 [2018-12-02 00:37:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:40,705 INFO L480 AbstractCegarLoop]: Abstraction has 6255 states and 13739 transitions. [2018-12-02 00:37:40,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:37:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 13739 transitions. [2018-12-02 00:37:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:40,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:40,709 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] [2018-12-02 00:37:40,709 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:40,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1022731331, now seen corresponding path program 1 times [2018-12-02 00:37:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:40,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:40,866 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-02 00:37:40,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 00:37:40,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:40,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:37:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:37:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:37:40,867 INFO L87 Difference]: Start difference. First operand 6255 states and 13739 transitions. Second operand 11 states. [2018-12-02 00:37:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:41,352 INFO L93 Difference]: Finished difference Result 8330 states and 18215 transitions. [2018-12-02 00:37:41,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 00:37:41,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 00:37:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:41,358 INFO L225 Difference]: With dead ends: 8330 [2018-12-02 00:37:41,358 INFO L226 Difference]: Without dead ends: 8330 [2018-12-02 00:37:41,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-12-02 00:37:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2018-12-02 00:37:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 6255. [2018-12-02 00:37:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2018-12-02 00:37:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 13723 transitions. [2018-12-02 00:37:41,418 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 13723 transitions. Word has length 96 [2018-12-02 00:37:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:41,419 INFO L480 AbstractCegarLoop]: Abstraction has 6255 states and 13723 transitions. [2018-12-02 00:37:41,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:37:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 13723 transitions. [2018-12-02 00:37:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:41,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:41,425 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] [2018-12-02 00:37:41,425 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:41,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -135227650, now seen corresponding path program 1 times [2018-12-02 00:37:41,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:41,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:41,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:41,511 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-02 00:37:41,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:41,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:37:41,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:41,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:37:41,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:37:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:41,512 INFO L87 Difference]: Start difference. First operand 6255 states and 13723 transitions. Second operand 8 states. [2018-12-02 00:37:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:41,740 INFO L93 Difference]: Finished difference Result 7273 states and 15758 transitions. [2018-12-02 00:37:41,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:37:41,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 00:37:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:41,746 INFO L225 Difference]: With dead ends: 7273 [2018-12-02 00:37:41,746 INFO L226 Difference]: Without dead ends: 7273 [2018-12-02 00:37:41,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-02 00:37:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2018-12-02 00:37:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 6363. [2018-12-02 00:37:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6363 states. [2018-12-02 00:37:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 13956 transitions. [2018-12-02 00:37:41,803 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 13956 transitions. Word has length 96 [2018-12-02 00:37:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:41,803 INFO L480 AbstractCegarLoop]: Abstraction has 6363 states and 13956 transitions. [2018-12-02 00:37:41,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:37:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 13956 transitions. [2018-12-02 00:37:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:41,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:41,807 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] [2018-12-02 00:37:41,807 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:41,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 76123263, now seen corresponding path program 1 times [2018-12-02 00:37:41,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:41,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:41,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:41,891 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-02 00:37:41,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:41,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 00:37:41,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:41,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:37:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:37:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:37:41,892 INFO L87 Difference]: Start difference. First operand 6363 states and 13956 transitions. Second operand 11 states. [2018-12-02 00:37:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:42,683 INFO L93 Difference]: Finished difference Result 11652 states and 25669 transitions. [2018-12-02 00:37:42,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 00:37:42,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 00:37:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:42,689 INFO L225 Difference]: With dead ends: 11652 [2018-12-02 00:37:42,689 INFO L226 Difference]: Without dead ends: 7967 [2018-12-02 00:37:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 00:37:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2018-12-02 00:37:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 6180. [2018-12-02 00:37:42,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6180 states. [2018-12-02 00:37:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 13451 transitions. [2018-12-02 00:37:42,738 INFO L78 Accepts]: Start accepts. Automaton has 6180 states and 13451 transitions. Word has length 96 [2018-12-02 00:37:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:42,738 INFO L480 AbstractCegarLoop]: Abstraction has 6180 states and 13451 transitions. [2018-12-02 00:37:42,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:37:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6180 states and 13451 transitions. [2018-12-02 00:37:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:42,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:42,742 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] [2018-12-02 00:37:42,742 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:42,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash 730373337, now seen corresponding path program 1 times [2018-12-02 00:37:42,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:42,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:42,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:42,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:42,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:42,788 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-02 00:37:42,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:42,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:37:42,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:42,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:37:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:37:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:37:42,789 INFO L87 Difference]: Start difference. First operand 6180 states and 13451 transitions. Second operand 6 states. [2018-12-02 00:37:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:42,959 INFO L93 Difference]: Finished difference Result 7257 states and 15808 transitions. [2018-12-02 00:37:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:37:42,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 00:37:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:42,963 INFO L225 Difference]: With dead ends: 7257 [2018-12-02 00:37:42,963 INFO L226 Difference]: Without dead ends: 7257 [2018-12-02 00:37:42,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:37:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7257 states. [2018-12-02 00:37:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7257 to 6436. [2018-12-02 00:37:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6436 states. [2018-12-02 00:37:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6436 states to 6436 states and 14002 transitions. [2018-12-02 00:37:43,011 INFO L78 Accepts]: Start accepts. Automaton has 6436 states and 14002 transitions. Word has length 96 [2018-12-02 00:37:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:43,011 INFO L480 AbstractCegarLoop]: Abstraction has 6436 states and 14002 transitions. [2018-12-02 00:37:43,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:37:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6436 states and 14002 transitions. [2018-12-02 00:37:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:43,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:43,016 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] [2018-12-02 00:37:43,016 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:43,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash 379743640, now seen corresponding path program 1 times [2018-12-02 00:37:43,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:43,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:43,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:43,082 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-02 00:37:43,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:43,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:37:43,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:43,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:37:43,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:37:43,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:37:43,083 INFO L87 Difference]: Start difference. First operand 6436 states and 14002 transitions. Second operand 5 states. [2018-12-02 00:37:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:43,173 INFO L93 Difference]: Finished difference Result 7219 states and 15635 transitions. [2018-12-02 00:37:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:37:43,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 00:37:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:43,177 INFO L225 Difference]: With dead ends: 7219 [2018-12-02 00:37:43,177 INFO L226 Difference]: Without dead ends: 7219 [2018-12-02 00:37:43,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7219 states. [2018-12-02 00:37:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7219 to 6199. [2018-12-02 00:37:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6199 states. [2018-12-02 00:37:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6199 states to 6199 states and 13482 transitions. [2018-12-02 00:37:43,223 INFO L78 Accepts]: Start accepts. Automaton has 6199 states and 13482 transitions. Word has length 96 [2018-12-02 00:37:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:43,223 INFO L480 AbstractCegarLoop]: Abstraction has 6199 states and 13482 transitions. [2018-12-02 00:37:43,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:37:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6199 states and 13482 transitions. [2018-12-02 00:37:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:43,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:43,227 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] [2018-12-02 00:37:43,227 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:43,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1335866392, now seen corresponding path program 2 times [2018-12-02 00:37:43,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:37:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:37:43,281 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-02 00:37:43,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:37:43,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:37:43,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:37:43,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:37:43,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:37:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:37:43,282 INFO L87 Difference]: Start difference. First operand 6199 states and 13482 transitions. Second operand 7 states. [2018-12-02 00:37:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:37:43,376 INFO L93 Difference]: Finished difference Result 7188 states and 15670 transitions. [2018-12-02 00:37:43,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:37:43,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 00:37:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:37:43,381 INFO L225 Difference]: With dead ends: 7188 [2018-12-02 00:37:43,381 INFO L226 Difference]: Without dead ends: 7188 [2018-12-02 00:37:43,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:37:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7188 states. [2018-12-02 00:37:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7188 to 5455. [2018-12-02 00:37:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5455 states. [2018-12-02 00:37:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 11835 transitions. [2018-12-02 00:37:43,422 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 11835 transitions. Word has length 96 [2018-12-02 00:37:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:37:43,422 INFO L480 AbstractCegarLoop]: Abstraction has 5455 states and 11835 transitions. [2018-12-02 00:37:43,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:37:43,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 11835 transitions. [2018-12-02 00:37:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 00:37:43,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:37:43,426 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] [2018-12-02 00:37:43,426 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:37:43,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:37:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2028968089, now seen corresponding path program 2 times [2018-12-02 00:37:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:37:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:37:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:37:43,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:37:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:37:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:37:43,462 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 00:37:43,532 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 00:37:43,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:37:43 BasicIcfg [2018-12-02 00:37:43,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:37:43,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:37:43,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:37:43,534 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:37:43,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:37:25" (3/4) ... [2018-12-02 00:37:43,536 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 00:37:43,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c4c389f-b5dc-4d02-ad08-9580e0065700/bin-2019/utaipan/witness.graphml [2018-12-02 00:37:43,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:37:43,609 INFO L168 Benchmark]: Toolchain (without parser) took 19076.30 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -660.5 MB). Peak memory consumption was 915.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,610 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-02 00:37:43,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,611 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:37:43,611 INFO L168 Benchmark]: RCFGBuilder took 363.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,611 INFO L168 Benchmark]: TraceAbstraction took 18257.26 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -616.0 MB). Peak memory consumption was 858.3 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,612 INFO L168 Benchmark]: Witness Printer took 74.66 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-02 00:37:43,613 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 322.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18257.26 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -616.0 MB). Peak memory consumption was 858.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.66 ms. Allocated memory is still 2.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=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] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=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] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=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] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=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}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=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] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=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] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=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] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L778] -1 pthread_t t1091; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK -1 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L717] 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_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L780] -1 pthread_t t1092; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L781] FCALL, FORK -1 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, 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] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L744] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L744] 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) [L745] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L745] 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)) [L746] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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)) [L747] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=2, 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_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)) [L748] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_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)) [L749] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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)) [L750] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L717] 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) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L756] 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=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 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=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_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] [L756] 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) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] 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=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_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] [L758] 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 [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L760] 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=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=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_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] [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L719] 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 [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L787] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L787] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L787] -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) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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 [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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$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 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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, 223 locations, 3 error locations. UNSAFE Result, 18.1s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 9.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9807 SDtfs, 11830 SDslu, 24381 SDs, 0 SdLazy, 10979 SolverSat, 666 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 96 SyntacticMatches, 45 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34807occurred 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: 4.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 94147 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3015 NumberOfCodeBlocks, 3015 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2882 ConstructedInterpolants, 0 QuantifiedInterpolants, 698457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...