./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:19:17,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:19:17,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:19:17,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:19:17,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:19:17,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:19:17,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:19:17,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:19:17,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:19:17,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:19:17,688 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:19:17,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:19:17,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:19:17,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:19:17,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:19:17,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:19:17,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:19:17,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:19:17,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:19:17,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:19:17,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:19:17,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:19:17,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:19:17,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:19:17,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:19:17,698 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:19:17,699 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:19:17,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:19:17,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:19:17,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:19:17,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:19:17,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:19:17,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:19:17,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:19:17,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:19:17,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:19:17,703 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:19:17,710 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:19:17,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:19:17,711 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:19:17,712 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:19:17,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:19:17,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:19:17,712 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:19:17,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:19:17,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:19:17,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:19:17,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:19:17,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:19:17,714 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:19:17,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:19:17,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:19:17,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:19:17,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:19:17,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:19:17,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:19:17,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:19:17,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:19:17,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:19:17,716 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:19:17,716 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:19:17,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:19:17,716 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer 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 -> Automizer 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 -> a9752f4889b9f4da24ba9fe6b10a5347d0ed5882 [2018-11-28 13:19:17,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:19:17,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:19:17,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:19:17,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:19:17,754 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:19:17,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-11-28 13:19:17,797 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/data/a2fcaa1ea/66a4fd22330f4023bdfb2ef7870a85b4/FLAGcb4985d1e [2018-11-28 13:19:18,253 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:19:18,254 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/sv-benchmarks/c/pthread-wmm/mix045_tso.oepc_false-unreach-call.i [2018-11-28 13:19:18,266 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/data/a2fcaa1ea/66a4fd22330f4023bdfb2ef7870a85b4/FLAGcb4985d1e [2018-11-28 13:19:18,775 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/data/a2fcaa1ea/66a4fd22330f4023bdfb2ef7870a85b4 [2018-11-28 13:19:18,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:19:18,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:19:18,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:19:18,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:19:18,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:19:18,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:19:18" (1/1) ... [2018-11-28 13:19:18,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8801579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:18, skipping insertion in model container [2018-11-28 13:19:18,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:19:18" (1/1) ... [2018-11-28 13:19:18,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:19:18,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:19:19,050 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:19:19,061 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:19:19,169 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:19:19,204 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:19:19,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19 WrapperNode [2018-11-28 13:19:19,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:19:19,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:19:19,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:19:19,205 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:19:19,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:19:19,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:19:19,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:19:19,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:19:19,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... [2018-11-28 13:19:19,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:19:19,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:19:19,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:19:19,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:19:19,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/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-11-28 13:19:19,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:19:19,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:19:19,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-11-28 13:19:19,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:19:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-11-28 13:19:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-11-28 13:19:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-11-28 13:19:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-11-28 13:19:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-11-28 13:19:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-11-28 13:19:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-11-28 13:19:19,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:19:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:19:19,309 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-11-28 13:19:19,735 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:19:19,735 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 13:19:19,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:19 BoogieIcfgContainer [2018-11-28 13:19:19,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:19:19,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:19:19,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:19:19,738 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:19:19,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:19:18" (1/3) ... [2018-11-28 13:19:19,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed30401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:19:19, skipping insertion in model container [2018-11-28 13:19:19,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:19:19" (2/3) ... [2018-11-28 13:19:19,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed30401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:19:19, skipping insertion in model container [2018-11-28 13:19:19,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:19" (3/3) ... [2018-11-28 13:19:19,740 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc_false-unreach-call.i [2018-11-28 13:19:19,768 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,769 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,770 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,771 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,771 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,772 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,773 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,774 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,775 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,776 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:19:19,799 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-11-28 13:19:19,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:19:19,807 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 13:19:19,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 13:19:19,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:19:19,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:19:19,842 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:19:19,842 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:19:19,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:19:19,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:19:19,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:19:19,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:19:19,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:19:19,852 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-11-28 13:19:35,425 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-11-28 13:19:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-11-28 13:19:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:19:35,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:35,435 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] [2018-11-28 13:19:35,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:35,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-11-28 13:19:35,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:35,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:35,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:35,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:19:35,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:19:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:19:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:19:35,647 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-11-28 13:19:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:37,238 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-11-28 13:19:37,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:19:37,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-28 13:19:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:38,209 INFO L225 Difference]: With dead ends: 233474 [2018-11-28 13:19:38,210 INFO L226 Difference]: Without dead ends: 203724 [2018-11-28 13:19:38,211 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-11-28 13:19:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-11-28 13:19:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-11-28 13:19:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 13:19:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-11-28 13:19:46,449 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-11-28 13:19:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:46,450 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-11-28 13:19:46,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:19:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-11-28 13:19:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:19:46,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:46,462 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] [2018-11-28 13:19:46,462 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:46,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-11-28 13:19:46,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:46,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:46,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:46,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:19:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:19:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:19:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:19:46,540 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-11-28 13:19:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:47,306 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-11-28 13:19:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:19:47,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 13:19:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:47,704 INFO L225 Difference]: With dead ends: 118894 [2018-11-28 13:19:47,704 INFO L226 Difference]: Without dead ends: 118894 [2018-11-28 13:19:47,705 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-11-28 13:19:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-11-28 13:19:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-11-28 13:19:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-11-28 13:19:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-11-28 13:19:51,451 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-11-28 13:19:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:51,452 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-11-28 13:19:51,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:19:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-11-28 13:19:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 13:19:51,456 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:51,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:51,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:51,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-11-28 13:19:51,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:19:51,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:19:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:51,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:19:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:19:51,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:19:51,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:19:51,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:19:51,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:19:51,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:19:51,531 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-11-28 13:19:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:57,302 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-11-28 13:19:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:19:57,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 13:19:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:58,170 INFO L225 Difference]: With dead ends: 325274 [2018-11-28 13:19:58,171 INFO L226 Difference]: Without dead ends: 324274 [2018-11-28 13:19:58,171 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-11-28 13:19:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-11-28 13:20:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-11-28 13:20:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-11-28 13:20:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-11-28 13:20:03,854 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-11-28 13:20:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:03,854 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-11-28 13:20:03,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:20:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-11-28 13:20:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:20:03,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:03,861 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-11-28 13:20:03,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:03,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-11-28 13:20:03,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:03,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:03,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:20:03,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:03,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:03,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:03,904 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 3 states. [2018-11-28 13:20:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:04,748 INFO L93 Difference]: Finished difference Result 186424 states and 840871 transitions. [2018-11-28 13:20:04,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:04,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-28 13:20:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:05,233 INFO L225 Difference]: With dead ends: 186424 [2018-11-28 13:20:05,234 INFO L226 Difference]: Without dead ends: 186424 [2018-11-28 13:20:05,234 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-11-28 13:20:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186424 states. [2018-11-28 13:20:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186424 to 186424. [2018-11-28 13:20:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-11-28 13:20:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840871 transitions. [2018-11-28 13:20:13,580 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840871 transitions. Word has length 53 [2018-11-28 13:20:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:13,580 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840871 transitions. [2018-11-28 13:20:13,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:20:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840871 transitions. [2018-11-28 13:20:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:20:13,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:13,589 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-11-28 13:20:13,589 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:13,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash -832854916, now seen corresponding path program 1 times [2018-11-28 13:20:13,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:13,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:20:13,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:13,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:20:13,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:20:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:20:13,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:20:13,653 INFO L87 Difference]: Start difference. First operand 186424 states and 840871 transitions. Second operand 5 states. [2018-11-28 13:20:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:16,307 INFO L93 Difference]: Finished difference Result 334054 states and 1500950 transitions. [2018-11-28 13:20:16,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:20:16,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 13:20:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:17,430 INFO L225 Difference]: With dead ends: 334054 [2018-11-28 13:20:17,430 INFO L226 Difference]: Without dead ends: 333004 [2018-11-28 13:20:17,430 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-11-28 13:20:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-11-28 13:20:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-11-28 13:20:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-11-28 13:20:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876429 transitions. [2018-11-28 13:20:29,335 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876429 transitions. Word has length 53 [2018-11-28 13:20:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:29,336 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876429 transitions. [2018-11-28 13:20:29,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:20:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876429 transitions. [2018-11-28 13:20:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 13:20:29,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:29,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:20:29,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:29,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:29,358 INFO L82 PathProgramCache]: Analyzing trace with hash 651985896, now seen corresponding path program 1 times [2018-11-28 13:20:29,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:29,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:29,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:29,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:20:29,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:29,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:20:29,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:20:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:20:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:20:29,425 INFO L87 Difference]: Start difference. First operand 194884 states and 876429 transitions. Second operand 6 states. [2018-11-28 13:20:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:31,866 INFO L93 Difference]: Finished difference Result 342294 states and 1509932 transitions. [2018-11-28 13:20:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 13:20:31,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-11-28 13:20:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:33,732 INFO L225 Difference]: With dead ends: 342294 [2018-11-28 13:20:33,732 INFO L226 Difference]: Without dead ends: 341294 [2018-11-28 13:20:33,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:20:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341294 states. [2018-11-28 13:20:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341294 to 189134. [2018-11-28 13:20:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189134 states. [2018-11-28 13:20:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189134 states to 189134 states and 850629 transitions. [2018-11-28 13:20:45,160 INFO L78 Accepts]: Start accepts. Automaton has 189134 states and 850629 transitions. Word has length 60 [2018-11-28 13:20:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:45,161 INFO L480 AbstractCegarLoop]: Abstraction has 189134 states and 850629 transitions. [2018-11-28 13:20:45,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:20:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 189134 states and 850629 transitions. [2018-11-28 13:20:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 13:20:45,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:45,245 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-11-28 13:20:45,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:45,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -643326952, now seen corresponding path program 1 times [2018-11-28 13:20:45,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:45,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:45,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:20:45,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:45,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:20:45,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:20:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:20:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:20:45,331 INFO L87 Difference]: Start difference. First operand 189134 states and 850629 transitions. Second operand 6 states. [2018-11-28 13:20:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:48,514 INFO L93 Difference]: Finished difference Result 402824 states and 1786031 transitions. [2018-11-28 13:20:48,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:20:48,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-28 13:20:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:20:50,837 INFO L225 Difference]: With dead ends: 402824 [2018-11-28 13:20:50,838 INFO L226 Difference]: Without dead ends: 401224 [2018-11-28 13:20:50,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:20:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401224 states. [2018-11-28 13:20:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401224 to 224569. [2018-11-28 13:20:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224569 states. [2018-11-28 13:20:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224569 states to 224569 states and 1000347 transitions. [2018-11-28 13:20:57,863 INFO L78 Accepts]: Start accepts. Automaton has 224569 states and 1000347 transitions. Word has length 67 [2018-11-28 13:20:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:20:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 224569 states and 1000347 transitions. [2018-11-28 13:20:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:20:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 224569 states and 1000347 transitions. [2018-11-28 13:20:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:20:57,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:20:57,992 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] [2018-11-28 13:20:57,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:20:57,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:20:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1444492136, now seen corresponding path program 1 times [2018-11-28 13:20:57,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:20:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:20:57,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:57,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:57,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:20:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:20:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:20:58,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:20:58,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:20:58,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:20:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:20:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:20:58,045 INFO L87 Difference]: Start difference. First operand 224569 states and 1000347 transitions. Second operand 3 states. [2018-11-28 13:20:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:20:59,668 INFO L93 Difference]: Finished difference Result 283189 states and 1243373 transitions. [2018-11-28 13:20:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:20:59,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 13:20:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:06,071 INFO L225 Difference]: With dead ends: 283189 [2018-11-28 13:21:06,071 INFO L226 Difference]: Without dead ends: 283189 [2018-11-28 13:21:06,071 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-11-28 13:21:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283189 states. [2018-11-28 13:21:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283189 to 245734. [2018-11-28 13:21:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245734 states. [2018-11-28 13:21:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245734 states to 245734 states and 1089139 transitions. [2018-11-28 13:21:12,601 INFO L78 Accepts]: Start accepts. Automaton has 245734 states and 1089139 transitions. Word has length 69 [2018-11-28 13:21:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:12,601 INFO L480 AbstractCegarLoop]: Abstraction has 245734 states and 1089139 transitions. [2018-11-28 13:21:12,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:21:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 245734 states and 1089139 transitions. [2018-11-28 13:21:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 13:21:12,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:12,778 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-11-28 13:21:12,779 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:21:12,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1764017531, now seen corresponding path program 1 times [2018-11-28 13:21:12,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:12,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:12,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:12,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:12,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:21:12,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:21:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:21:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:21:12,847 INFO L87 Difference]: Start difference. First operand 245734 states and 1089139 transitions. Second operand 4 states. [2018-11-28 13:21:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:15,930 INFO L93 Difference]: Finished difference Result 374149 states and 1647301 transitions. [2018-11-28 13:21:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:21:15,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-28 13:21:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:17,945 INFO L225 Difference]: With dead ends: 374149 [2018-11-28 13:21:17,946 INFO L226 Difference]: Without dead ends: 371924 [2018-11-28 13:21:17,946 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-11-28 13:21:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371924 states. [2018-11-28 13:21:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371924 to 310054. [2018-11-28 13:21:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310054 states. [2018-11-28 13:21:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310054 states to 310054 states and 1375940 transitions. [2018-11-28 13:21:27,088 INFO L78 Accepts]: Start accepts. Automaton has 310054 states and 1375940 transitions. Word has length 73 [2018-11-28 13:21:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:27,088 INFO L480 AbstractCegarLoop]: Abstraction has 310054 states and 1375940 transitions. [2018-11-28 13:21:27,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:21:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 310054 states and 1375940 transitions. [2018-11-28 13:21:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 13:21:27,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:27,346 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-11-28 13:21:27,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:21:27,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash -519253050, now seen corresponding path program 1 times [2018-11-28 13:21:27,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:27,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-11-28 13:21:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:21:27,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:21:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:21:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:21:27,488 INFO L87 Difference]: Start difference. First operand 310054 states and 1375940 transitions. Second operand 5 states. [2018-11-28 13:21:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:21:35,272 INFO L93 Difference]: Finished difference Result 485539 states and 2134528 transitions. [2018-11-28 13:21:35,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:21:35,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-28 13:21:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:21:36,724 INFO L225 Difference]: With dead ends: 485539 [2018-11-28 13:21:36,724 INFO L226 Difference]: Without dead ends: 484749 [2018-11-28 13:21:36,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484749 states. [2018-11-28 13:21:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484749 to 444414. [2018-11-28 13:21:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444414 states. [2018-11-28 13:21:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444414 states to 444414 states and 1962978 transitions. [2018-11-28 13:21:48,607 INFO L78 Accepts]: Start accepts. Automaton has 444414 states and 1962978 transitions. Word has length 73 [2018-11-28 13:21:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:21:48,607 INFO L480 AbstractCegarLoop]: Abstraction has 444414 states and 1962978 transitions. [2018-11-28 13:21:48,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:21:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 444414 states and 1962978 transitions. [2018-11-28 13:21:49,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 13:21:49,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:21:49,032 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-11-28 13:21:49,033 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:21:49,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:21:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1363724921, now seen corresponding path program 1 times [2018-11-28 13:21:49,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:21:49,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:21:49,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:21:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:21:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:21:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:21:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:21:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:21:49,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:21:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:21:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:21:49,147 INFO L87 Difference]: Start difference. First operand 444414 states and 1962978 transitions. Second operand 7 states. [2018-11-28 13:22:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:00,856 INFO L93 Difference]: Finished difference Result 778794 states and 3403142 transitions. [2018-11-28 13:22:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:22:00,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-11-28 13:22:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:03,930 INFO L225 Difference]: With dead ends: 778794 [2018-11-28 13:22:03,930 INFO L226 Difference]: Without dead ends: 777194 [2018-11-28 13:22:03,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:22:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777194 states. [2018-11-28 13:22:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777194 to 453624. [2018-11-28 13:22:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453624 states. [2018-11-28 13:22:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453624 states to 453624 states and 2000501 transitions. [2018-11-28 13:22:17,038 INFO L78 Accepts]: Start accepts. Automaton has 453624 states and 2000501 transitions. Word has length 73 [2018-11-28 13:22:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:17,038 INFO L480 AbstractCegarLoop]: Abstraction has 453624 states and 2000501 transitions. [2018-11-28 13:22:17,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 453624 states and 2000501 transitions. [2018-11-28 13:22:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:22:17,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:17,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:22:17,376 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:22:17,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1686899962, now seen corresponding path program 1 times [2018-11-28 13:22:17,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:17,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:17,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:22:17,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:22:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:22:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:22:17,434 INFO L87 Difference]: Start difference. First operand 453624 states and 2000501 transitions. Second operand 4 states. [2018-11-28 13:22:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:20,340 INFO L93 Difference]: Finished difference Result 400120 states and 1737408 transitions. [2018-11-28 13:22:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:22:20,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-28 13:22:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:29,461 INFO L225 Difference]: With dead ends: 400120 [2018-11-28 13:22:29,462 INFO L226 Difference]: Without dead ends: 397515 [2018-11-28 13:22:29,462 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-11-28 13:22:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397515 states. [2018-11-28 13:22:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397515 to 397515. [2018-11-28 13:22:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397515 states. [2018-11-28 13:22:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397515 states to 397515 states and 1728736 transitions. [2018-11-28 13:22:37,941 INFO L78 Accepts]: Start accepts. Automaton has 397515 states and 1728736 transitions. Word has length 74 [2018-11-28 13:22:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:37,941 INFO L480 AbstractCegarLoop]: Abstraction has 397515 states and 1728736 transitions. [2018-11-28 13:22:37,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:22:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 397515 states and 1728736 transitions. [2018-11-28 13:22:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-28 13:22:38,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:22:38,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] [2018-11-28 13:22:38,226 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:22:38,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:22:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -756700490, now seen corresponding path program 1 times [2018-11-28 13:22:38,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:22:38,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:22:38,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:38,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:22:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:22:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:22:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:22:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:22:38,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:22:38,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:22:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:22:38,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:22:38,295 INFO L87 Difference]: Start difference. First operand 397515 states and 1728736 transitions. Second operand 7 states. [2018-11-28 13:22:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:22:41,958 INFO L93 Difference]: Finished difference Result 515847 states and 2230337 transitions. [2018-11-28 13:22:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:22:41,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-28 13:22:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:22:44,143 INFO L225 Difference]: With dead ends: 515847 [2018-11-28 13:22:44,143 INFO L226 Difference]: Without dead ends: 514687 [2018-11-28 13:22:44,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:22:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514687 states. [2018-11-28 13:22:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514687 to 400655. [2018-11-28 13:22:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400655 states. [2018-11-28 13:22:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400655 states to 400655 states and 1741263 transitions. [2018-11-28 13:22:54,008 INFO L78 Accepts]: Start accepts. Automaton has 400655 states and 1741263 transitions. Word has length 75 [2018-11-28 13:22:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:22:54,009 INFO L480 AbstractCegarLoop]: Abstraction has 400655 states and 1741263 transitions. [2018-11-28 13:22:54,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:22:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 400655 states and 1741263 transitions. [2018-11-28 13:23:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 13:23:03,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:03,527 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] [2018-11-28 13:23:03,528 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:23:03,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1674825725, now seen corresponding path program 1 times [2018-11-28 13:23:03,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:03,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:03,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:03,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:03,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:23:03,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:23:03,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:23:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:23:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:23:03,618 INFO L87 Difference]: Start difference. First operand 400655 states and 1741263 transitions. Second operand 6 states. [2018-11-28 13:23:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:06,505 INFO L93 Difference]: Finished difference Result 472323 states and 2037105 transitions. [2018-11-28 13:23:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-28 13:23:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:07,823 INFO L225 Difference]: With dead ends: 472323 [2018-11-28 13:23:07,823 INFO L226 Difference]: Without dead ends: 467531 [2018-11-28 13:23:07,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:23:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467531 states. [2018-11-28 13:23:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467531 to 396771. [2018-11-28 13:23:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396771 states. [2018-11-28 13:23:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396771 states to 396771 states and 1724829 transitions. [2018-11-28 13:23:18,185 INFO L78 Accepts]: Start accepts. Automaton has 396771 states and 1724829 transitions. Word has length 77 [2018-11-28 13:23:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:23:18,186 INFO L480 AbstractCegarLoop]: Abstraction has 396771 states and 1724829 transitions. [2018-11-28 13:23:18,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:23:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 396771 states and 1724829 transitions. [2018-11-28 13:23:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 13:23:18,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:18,603 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] [2018-11-28 13:23:18,603 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:23:18,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1957976189, now seen corresponding path program 1 times [2018-11-28 13:23:18,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:18,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:18,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:18,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:23:18,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:23:18,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:23:18,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:23:18,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:23:18,705 INFO L87 Difference]: Start difference. First operand 396771 states and 1724829 transitions. Second operand 7 states. [2018-11-28 13:23:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:22,329 INFO L93 Difference]: Finished difference Result 517291 states and 2209451 transitions. [2018-11-28 13:23:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:23:22,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-28 13:23:22,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:23,829 INFO L225 Difference]: With dead ends: 517291 [2018-11-28 13:23:23,830 INFO L226 Difference]: Without dead ends: 517291 [2018-11-28 13:23:23,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:23:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517291 states. [2018-11-28 13:23:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517291 to 479331. [2018-11-28 13:23:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479331 states. [2018-11-28 13:23:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479331 states to 479331 states and 2060157 transitions. [2018-11-28 13:23:41,997 INFO L78 Accepts]: Start accepts. Automaton has 479331 states and 2060157 transitions. Word has length 77 [2018-11-28 13:23:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:23:41,997 INFO L480 AbstractCegarLoop]: Abstraction has 479331 states and 2060157 transitions. [2018-11-28 13:23:41,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:23:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 479331 states and 2060157 transitions. [2018-11-28 13:23:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 13:23:43,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:43,731 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] [2018-11-28 13:23:43,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:23:43,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash -713211708, now seen corresponding path program 1 times [2018-11-28 13:23:43,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:43,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:43,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:23:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:23:43,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:23:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:23:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:23:43,782 INFO L87 Difference]: Start difference. First operand 479331 states and 2060157 transitions. Second operand 5 states. [2018-11-28 13:23:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:44,343 INFO L93 Difference]: Finished difference Result 145491 states and 577373 transitions. [2018-11-28 13:23:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:23:44,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-28 13:23:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:44,672 INFO L225 Difference]: With dead ends: 145491 [2018-11-28 13:23:44,672 INFO L226 Difference]: Without dead ends: 143099 [2018-11-28 13:23:44,672 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-11-28 13:23:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143099 states. [2018-11-28 13:23:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143099 to 143039. [2018-11-28 13:23:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143039 states. [2018-11-28 13:23:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143039 states to 143039 states and 568209 transitions. [2018-11-28 13:23:47,695 INFO L78 Accepts]: Start accepts. Automaton has 143039 states and 568209 transitions. Word has length 77 [2018-11-28 13:23:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:23:47,695 INFO L480 AbstractCegarLoop]: Abstraction has 143039 states and 568209 transitions. [2018-11-28 13:23:47,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:23:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 143039 states and 568209 transitions. [2018-11-28 13:23:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 13:23:47,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:47,830 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] [2018-11-28 13:23:47,831 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:23:47,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 20579620, now seen corresponding path program 1 times [2018-11-28 13:23:47,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:47,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:23:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:23:47,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:23:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:23:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:23:47,889 INFO L87 Difference]: Start difference. First operand 143039 states and 568209 transitions. Second operand 4 states. [2018-11-28 13:23:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:49,402 INFO L93 Difference]: Finished difference Result 180711 states and 711830 transitions. [2018-11-28 13:23:49,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:23:49,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-28 13:23:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:49,788 INFO L225 Difference]: With dead ends: 180711 [2018-11-28 13:23:49,788 INFO L226 Difference]: Without dead ends: 180711 [2018-11-28 13:23:49,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-28 13:23:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180711 states. [2018-11-28 13:23:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180711 to 148311. [2018-11-28 13:23:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148311 states. [2018-11-28 13:23:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148311 states to 148311 states and 587982 transitions. [2018-11-28 13:23:52,545 INFO L78 Accepts]: Start accepts. Automaton has 148311 states and 587982 transitions. Word has length 87 [2018-11-28 13:23:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:23:52,546 INFO L480 AbstractCegarLoop]: Abstraction has 148311 states and 587982 transitions. [2018-11-28 13:23:52,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:23:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 148311 states and 587982 transitions. [2018-11-28 13:23:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 13:23:52,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:23:52,693 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] [2018-11-28 13:23:52,693 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:23:52,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:23:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1855079427, now seen corresponding path program 1 times [2018-11-28 13:23:52,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:23:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:23:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:23:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:23:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:23:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:23:52,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:23:52,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:23:52,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:23:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:23:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:23:52,740 INFO L87 Difference]: Start difference. First operand 148311 states and 587982 transitions. Second operand 4 states. [2018-11-28 13:23:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:23:54,369 INFO L93 Difference]: Finished difference Result 203302 states and 797948 transitions. [2018-11-28 13:23:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:23:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-28 13:23:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:23:54,865 INFO L225 Difference]: With dead ends: 203302 [2018-11-28 13:23:54,865 INFO L226 Difference]: Without dead ends: 203302 [2018-11-28 13:23:54,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:23:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203302 states. [2018-11-28 13:23:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203302 to 184999. [2018-11-28 13:23:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184999 states. [2018-11-28 13:24:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184999 states to 184999 states and 729750 transitions. [2018-11-28 13:24:02,624 INFO L78 Accepts]: Start accepts. Automaton has 184999 states and 729750 transitions. Word has length 87 [2018-11-28 13:24:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:02,624 INFO L480 AbstractCegarLoop]: Abstraction has 184999 states and 729750 transitions. [2018-11-28 13:24:02,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:24:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 184999 states and 729750 transitions. [2018-11-28 13:24:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-28 13:24:02,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:02,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 13:24:02,820 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:02,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -80580860, now seen corresponding path program 1 times [2018-11-28 13:24:02,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:02,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:02,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:02,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:02,879 INFO L87 Difference]: Start difference. First operand 184999 states and 729750 transitions. Second operand 6 states. [2018-11-28 13:24:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:02,974 INFO L93 Difference]: Finished difference Result 23095 states and 78958 transitions. [2018-11-28 13:24:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:02,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-28 13:24:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:03,001 INFO L225 Difference]: With dead ends: 23095 [2018-11-28 13:24:03,001 INFO L226 Difference]: Without dead ends: 21003 [2018-11-28 13:24:03,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:24:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-11-28 13:24:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 20468. [2018-11-28 13:24:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20468 states. [2018-11-28 13:24:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20468 states to 20468 states and 69983 transitions. [2018-11-28 13:24:03,229 INFO L78 Accepts]: Start accepts. Automaton has 20468 states and 69983 transitions. Word has length 87 [2018-11-28 13:24:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:03,230 INFO L480 AbstractCegarLoop]: Abstraction has 20468 states and 69983 transitions. [2018-11-28 13:24:03,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20468 states and 69983 transitions. [2018-11-28 13:24:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:24:03,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:03,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:03,248 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:03,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -899863943, now seen corresponding path program 1 times [2018-11-28 13:24:03,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:03,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:03,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:24:03,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:24:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:24:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:03,313 INFO L87 Difference]: Start difference. First operand 20468 states and 69983 transitions. Second operand 5 states. [2018-11-28 13:24:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:03,463 INFO L93 Difference]: Finished difference Result 22353 states and 75776 transitions. [2018-11-28 13:24:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:24:03,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-28 13:24:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:03,493 INFO L225 Difference]: With dead ends: 22353 [2018-11-28 13:24:03,493 INFO L226 Difference]: Without dead ends: 22353 [2018-11-28 13:24:03,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22353 states. [2018-11-28 13:24:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22353 to 20878. [2018-11-28 13:24:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20878 states. [2018-11-28 13:24:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20878 states to 20878 states and 71326 transitions. [2018-11-28 13:24:03,728 INFO L78 Accepts]: Start accepts. Automaton has 20878 states and 71326 transitions. Word has length 100 [2018-11-28 13:24:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:03,728 INFO L480 AbstractCegarLoop]: Abstraction has 20878 states and 71326 transitions. [2018-11-28 13:24:03,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:24:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 20878 states and 71326 transitions. [2018-11-28 13:24:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:24:03,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:03,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:03,746 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:03,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1211886702, now seen corresponding path program 1 times [2018-11-28 13:24:03,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:03,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:03,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:24:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:24:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:24:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:24:03,798 INFO L87 Difference]: Start difference. First operand 20878 states and 71326 transitions. Second operand 4 states. [2018-11-28 13:24:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:03,947 INFO L93 Difference]: Finished difference Result 23729 states and 80154 transitions. [2018-11-28 13:24:03,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:24:03,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 13:24:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:03,976 INFO L225 Difference]: With dead ends: 23729 [2018-11-28 13:24:03,976 INFO L226 Difference]: Without dead ends: 23589 [2018-11-28 13:24:03,976 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-11-28 13:24:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23589 states. [2018-11-28 13:24:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23589 to 23256. [2018-11-28 13:24:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23256 states. [2018-11-28 13:24:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23256 states to 23256 states and 78787 transitions. [2018-11-28 13:24:04,517 INFO L78 Accepts]: Start accepts. Automaton has 23256 states and 78787 transitions. Word has length 100 [2018-11-28 13:24:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 23256 states and 78787 transitions. [2018-11-28 13:24:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:24:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23256 states and 78787 transitions. [2018-11-28 13:24:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:24:04,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:04,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:04,537 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:04,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:04,537 INFO L82 PathProgramCache]: Analyzing trace with hash -242305679, now seen corresponding path program 1 times [2018-11-28 13:24:04,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:04,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:04,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:04,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:04,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:04,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:04,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:24:04,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:24:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:24:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:24:04,600 INFO L87 Difference]: Start difference. First operand 23256 states and 78787 transitions. Second operand 4 states. [2018-11-28 13:24:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:04,802 INFO L93 Difference]: Finished difference Result 28856 states and 98170 transitions. [2018-11-28 13:24:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:24:04,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-28 13:24:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:04,839 INFO L225 Difference]: With dead ends: 28856 [2018-11-28 13:24:04,839 INFO L226 Difference]: Without dead ends: 28856 [2018-11-28 13:24:04,839 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-11-28 13:24:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2018-11-28 13:24:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 22521. [2018-11-28 13:24:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22521 states. [2018-11-28 13:24:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22521 states to 22521 states and 76129 transitions. [2018-11-28 13:24:05,118 INFO L78 Accepts]: Start accepts. Automaton has 22521 states and 76129 transitions. Word has length 100 [2018-11-28 13:24:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:05,118 INFO L480 AbstractCegarLoop]: Abstraction has 22521 states and 76129 transitions. [2018-11-28 13:24:05,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:24:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22521 states and 76129 transitions. [2018-11-28 13:24:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-28 13:24:05,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:05,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:05,137 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:05,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash -978148605, now seen corresponding path program 2 times [2018-11-28 13:24:05,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:05,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:05,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:24:05,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:24:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:24:05,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:05,202 INFO L87 Difference]: Start difference. First operand 22521 states and 76129 transitions. Second operand 5 states. [2018-11-28 13:24:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:05,377 INFO L93 Difference]: Finished difference Result 24497 states and 82257 transitions. [2018-11-28 13:24:05,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:24:05,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-28 13:24:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:05,410 INFO L225 Difference]: With dead ends: 24497 [2018-11-28 13:24:05,410 INFO L226 Difference]: Without dead ends: 24357 [2018-11-28 13:24:05,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-11-28 13:24:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24357 states. [2018-11-28 13:24:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24357 to 22151. [2018-11-28 13:24:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22151 states. [2018-11-28 13:24:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22151 states to 22151 states and 74898 transitions. [2018-11-28 13:24:05,656 INFO L78 Accepts]: Start accepts. Automaton has 22151 states and 74898 transitions. Word has length 100 [2018-11-28 13:24:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 22151 states and 74898 transitions. [2018-11-28 13:24:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:24:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 22151 states and 74898 transitions. [2018-11-28 13:24:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:24:05,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:05,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:05,675 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:05,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:05,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1242911627, now seen corresponding path program 1 times [2018-11-28 13:24:05,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:05,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:05,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:05,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:05,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:05,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:05,735 INFO L87 Difference]: Start difference. First operand 22151 states and 74898 transitions. Second operand 6 states. [2018-11-28 13:24:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:06,000 INFO L93 Difference]: Finished difference Result 24026 states and 80153 transitions. [2018-11-28 13:24:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:06,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 13:24:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:06,027 INFO L225 Difference]: With dead ends: 24026 [2018-11-28 13:24:06,028 INFO L226 Difference]: Without dead ends: 23451 [2018-11-28 13:24:06,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23451 states. [2018-11-28 13:24:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23451 to 22976. [2018-11-28 13:24:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22976 states. [2018-11-28 13:24:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22976 states to 22976 states and 77268 transitions. [2018-11-28 13:24:06,267 INFO L78 Accepts]: Start accepts. Automaton has 22976 states and 77268 transitions. Word has length 102 [2018-11-28 13:24:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:06,267 INFO L480 AbstractCegarLoop]: Abstraction has 22976 states and 77268 transitions. [2018-11-28 13:24:06,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22976 states and 77268 transitions. [2018-11-28 13:24:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:24:06,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:06,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:06,286 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:06,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:06,287 INFO L82 PathProgramCache]: Analyzing trace with hash 457828852, now seen corresponding path program 1 times [2018-11-28 13:24:06,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:06,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:06,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:06,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:06,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:24:06,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:24:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:24:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:06,378 INFO L87 Difference]: Start difference. First operand 22976 states and 77268 transitions. Second operand 7 states. [2018-11-28 13:24:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:06,902 INFO L93 Difference]: Finished difference Result 24465 states and 82047 transitions. [2018-11-28 13:24:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:06,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-11-28 13:24:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:06,933 INFO L225 Difference]: With dead ends: 24465 [2018-11-28 13:24:06,933 INFO L226 Difference]: Without dead ends: 24465 [2018-11-28 13:24:06,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2018-11-28 13:24:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 22861. [2018-11-28 13:24:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22861 states. [2018-11-28 13:24:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 76956 transitions. [2018-11-28 13:24:07,198 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 76956 transitions. Word has length 102 [2018-11-28 13:24:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:07,198 INFO L480 AbstractCegarLoop]: Abstraction has 22861 states and 76956 transitions. [2018-11-28 13:24:07,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:24:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 76956 transitions. [2018-11-28 13:24:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:24:07,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:07,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:07,222 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:07,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1868708372, now seen corresponding path program 1 times [2018-11-28 13:24:07,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:07,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:07,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:07,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:07,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:24:07,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:24:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:24:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:07,296 INFO L87 Difference]: Start difference. First operand 22861 states and 76956 transitions. Second operand 5 states. [2018-11-28 13:24:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:07,427 INFO L93 Difference]: Finished difference Result 20572 states and 69257 transitions. [2018-11-28 13:24:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:24:07,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-11-28 13:24:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:07,454 INFO L225 Difference]: With dead ends: 20572 [2018-11-28 13:24:07,454 INFO L226 Difference]: Without dead ends: 20572 [2018-11-28 13:24:07,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20572 states. [2018-11-28 13:24:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20572 to 20102. [2018-11-28 13:24:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2018-11-28 13:24:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 67911 transitions. [2018-11-28 13:24:07,687 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 67911 transitions. Word has length 102 [2018-11-28 13:24:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:07,687 INFO L480 AbstractCegarLoop]: Abstraction has 20102 states and 67911 transitions. [2018-11-28 13:24:07,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:24:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 67911 transitions. [2018-11-28 13:24:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-28 13:24:07,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:07,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:07,708 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:07,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 82504981, now seen corresponding path program 1 times [2018-11-28 13:24:07,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:07,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:07,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:07,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:07,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:07,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:07,794 INFO L87 Difference]: Start difference. First operand 20102 states and 67911 transitions. Second operand 6 states. [2018-11-28 13:24:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:07,926 INFO L93 Difference]: Finished difference Result 12934 states and 42375 transitions. [2018-11-28 13:24:07,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:24:07,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-28 13:24:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:07,942 INFO L225 Difference]: With dead ends: 12934 [2018-11-28 13:24:07,942 INFO L226 Difference]: Without dead ends: 12934 [2018-11-28 13:24:07,943 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-11-28 13:24:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2018-11-28 13:24:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11445. [2018-11-28 13:24:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11445 states. [2018-11-28 13:24:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11445 states to 11445 states and 37761 transitions. [2018-11-28 13:24:08,066 INFO L78 Accepts]: Start accepts. Automaton has 11445 states and 37761 transitions. Word has length 102 [2018-11-28 13:24:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:08,067 INFO L480 AbstractCegarLoop]: Abstraction has 11445 states and 37761 transitions. [2018-11-28 13:24:08,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11445 states and 37761 transitions. [2018-11-28 13:24:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:08,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:08,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:08,076 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:08,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash -656821095, now seen corresponding path program 1 times [2018-11-28 13:24:08,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:24:08,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:24:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:24:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:08,131 INFO L87 Difference]: Start difference. First operand 11445 states and 37761 transitions. Second operand 7 states. [2018-11-28 13:24:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:08,488 INFO L93 Difference]: Finished difference Result 18627 states and 60109 transitions. [2018-11-28 13:24:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:24:08,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 13:24:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:08,511 INFO L225 Difference]: With dead ends: 18627 [2018-11-28 13:24:08,511 INFO L226 Difference]: Without dead ends: 18499 [2018-11-28 13:24:08,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:24:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18499 states. [2018-11-28 13:24:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18499 to 14353. [2018-11-28 13:24:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14353 states. [2018-11-28 13:24:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14353 states to 14353 states and 46923 transitions. [2018-11-28 13:24:08,685 INFO L78 Accepts]: Start accepts. Automaton has 14353 states and 46923 transitions. Word has length 104 [2018-11-28 13:24:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 14353 states and 46923 transitions. [2018-11-28 13:24:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:24:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 14353 states and 46923 transitions. [2018-11-28 13:24:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:08,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:08,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:08,699 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:08,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 587943386, now seen corresponding path program 1 times [2018-11-28 13:24:08,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:08,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:08,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:08,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:08,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:08,770 INFO L87 Difference]: Start difference. First operand 14353 states and 46923 transitions. Second operand 6 states. [2018-11-28 13:24:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:08,893 INFO L93 Difference]: Finished difference Result 14593 states and 47275 transitions. [2018-11-28 13:24:08,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:24:08,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 13:24:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:08,910 INFO L225 Difference]: With dead ends: 14593 [2018-11-28 13:24:08,910 INFO L226 Difference]: Without dead ends: 14593 [2018-11-28 13:24:08,911 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-11-28 13:24:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2018-11-28 13:24:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 14203. [2018-11-28 13:24:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14203 states. [2018-11-28 13:24:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14203 states to 14203 states and 46213 transitions. [2018-11-28 13:24:09,097 INFO L78 Accepts]: Start accepts. Automaton has 14203 states and 46213 transitions. Word has length 104 [2018-11-28 13:24:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:09,097 INFO L480 AbstractCegarLoop]: Abstraction has 14203 states and 46213 transitions. [2018-11-28 13:24:09,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 14203 states and 46213 transitions. [2018-11-28 13:24:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:09,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:09,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:09,110 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:09,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 712016633, now seen corresponding path program 1 times [2018-11-28 13:24:09,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:09,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:09,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:09,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:09,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:09,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:09,190 INFO L87 Difference]: Start difference. First operand 14203 states and 46213 transitions. Second operand 6 states. [2018-11-28 13:24:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:09,313 INFO L93 Difference]: Finished difference Result 13775 states and 44775 transitions. [2018-11-28 13:24:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:24:09,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 13:24:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:09,330 INFO L225 Difference]: With dead ends: 13775 [2018-11-28 13:24:09,330 INFO L226 Difference]: Without dead ends: 13775 [2018-11-28 13:24:09,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:24:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13775 states. [2018-11-28 13:24:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13775 to 13465. [2018-11-28 13:24:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13465 states. [2018-11-28 13:24:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13465 states to 13465 states and 43862 transitions. [2018-11-28 13:24:09,477 INFO L78 Accepts]: Start accepts. Automaton has 13465 states and 43862 transitions. Word has length 104 [2018-11-28 13:24:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:09,478 INFO L480 AbstractCegarLoop]: Abstraction has 13465 states and 43862 transitions. [2018-11-28 13:24:09,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13465 states and 43862 transitions. [2018-11-28 13:24:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:09,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:09,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:09,489 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:09,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:09,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1100056151, now seen corresponding path program 1 times [2018-11-28 13:24:09,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:09,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:09,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:09,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-11-28 13:24:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:09,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:24:09,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:24:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:24:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:24:09,554 INFO L87 Difference]: Start difference. First operand 13465 states and 43862 transitions. Second operand 5 states. [2018-11-28 13:24:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:09,683 INFO L93 Difference]: Finished difference Result 15257 states and 49622 transitions. [2018-11-28 13:24:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:24:09,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-11-28 13:24:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:09,700 INFO L225 Difference]: With dead ends: 15257 [2018-11-28 13:24:09,701 INFO L226 Difference]: Without dead ends: 15129 [2018-11-28 13:24:09,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15129 states. [2018-11-28 13:24:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15129 to 12462. [2018-11-28 13:24:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12462 states. [2018-11-28 13:24:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12462 states to 12462 states and 40551 transitions. [2018-11-28 13:24:09,849 INFO L78 Accepts]: Start accepts. Automaton has 12462 states and 40551 transitions. Word has length 104 [2018-11-28 13:24:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:09,849 INFO L480 AbstractCegarLoop]: Abstraction has 12462 states and 40551 transitions. [2018-11-28 13:24:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:24:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 12462 states and 40551 transitions. [2018-11-28 13:24:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:09,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:09,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:09,859 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:09,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1950146664, now seen corresponding path program 1 times [2018-11-28 13:24:09,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:09,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:09,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 13:24:09,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:24:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:24:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:24:09,974 INFO L87 Difference]: Start difference. First operand 12462 states and 40551 transitions. Second operand 10 states. [2018-11-28 13:24:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:10,300 INFO L93 Difference]: Finished difference Result 23562 states and 77096 transitions. [2018-11-28 13:24:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:24:10,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-11-28 13:24:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:10,314 INFO L225 Difference]: With dead ends: 23562 [2018-11-28 13:24:10,314 INFO L226 Difference]: Without dead ends: 11738 [2018-11-28 13:24:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:24:10,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11738 states. [2018-11-28 13:24:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11738 to 11738. [2018-11-28 13:24:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11738 states. [2018-11-28 13:24:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 38395 transitions. [2018-11-28 13:24:10,432 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 38395 transitions. Word has length 104 [2018-11-28 13:24:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:10,433 INFO L480 AbstractCegarLoop]: Abstraction has 11738 states and 38395 transitions. [2018-11-28 13:24:10,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:24:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 38395 transitions. [2018-11-28 13:24:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:10,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:10,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:10,442 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:10,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1449845380, now seen corresponding path program 2 times [2018-11-28 13:24:10,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:10,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:10,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:10,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:10,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:10,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:24:10,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:24:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:24:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:24:10,526 INFO L87 Difference]: Start difference. First operand 11738 states and 38395 transitions. Second operand 7 states. [2018-11-28 13:24:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:10,718 INFO L93 Difference]: Finished difference Result 19468 states and 64493 transitions. [2018-11-28 13:24:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:24:10,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-11-28 13:24:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:10,728 INFO L225 Difference]: With dead ends: 19468 [2018-11-28 13:24:10,728 INFO L226 Difference]: Without dead ends: 7963 [2018-11-28 13:24:10,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:24:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7963 states. [2018-11-28 13:24:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7963 to 7963. [2018-11-28 13:24:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2018-11-28 13:24:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 26708 transitions. [2018-11-28 13:24:10,808 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 26708 transitions. Word has length 104 [2018-11-28 13:24:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:10,808 INFO L480 AbstractCegarLoop]: Abstraction has 7963 states and 26708 transitions. [2018-11-28 13:24:10,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:24:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 26708 transitions. [2018-11-28 13:24:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:10,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:10,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:10,815 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:10,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-11-28 13:24:10,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:10,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:10,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:24:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:24:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:24:10,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:24:10,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:24:10,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:24:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:24:10,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:24:10,882 INFO L87 Difference]: Start difference. First operand 7963 states and 26708 transitions. Second operand 6 states. [2018-11-28 13:24:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:24:11,024 INFO L93 Difference]: Finished difference Result 8203 states and 27328 transitions. [2018-11-28 13:24:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:24:11,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-28 13:24:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:24:11,034 INFO L225 Difference]: With dead ends: 8203 [2018-11-28 13:24:11,034 INFO L226 Difference]: Without dead ends: 8123 [2018-11-28 13:24:11,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:24:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8123 states. [2018-11-28 13:24:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8123 to 7931. [2018-11-28 13:24:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7931 states. [2018-11-28 13:24:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 26604 transitions. [2018-11-28 13:24:11,114 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 26604 transitions. Word has length 104 [2018-11-28 13:24:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:24:11,115 INFO L480 AbstractCegarLoop]: Abstraction has 7931 states and 26604 transitions. [2018-11-28 13:24:11,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:24:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 26604 transitions. [2018-11-28 13:24:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:24:11,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:24:11,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:24:11,122 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:24:11,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:24:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-11-28 13:24:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:24:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:24:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:24:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:24:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:24:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:24:11,168 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:24:11,269 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-11-28 13:24:11,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:24:11 BasicIcfg [2018-11-28 13:24:11,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:24:11,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:24:11,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:24:11,271 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:24:11,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:19:19" (3/4) ... [2018-11-28 13:24:11,273 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:24:11,368 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1786d0e1-a129-4e35-8c41-15fc46b34e77/bin-2019/uautomizer/witness.graphml [2018-11-28 13:24:11,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:24:11,369 INFO L168 Benchmark]: Toolchain (without parser) took 292591.53 ms. Allocated memory was 1.0 GB in the beginning and 10.3 GB in the end (delta: 9.3 GB). Free memory was 950.6 MB in the beginning and 6.7 GB in the end (delta: -5.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,370 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:24:11,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,371 INFO L168 Benchmark]: Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,371 INFO L168 Benchmark]: RCFGBuilder took 461.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,371 INFO L168 Benchmark]: TraceAbstraction took 291534.39 ms. Allocated memory was 1.2 GB in the beginning and 10.3 GB in the end (delta: 9.1 GB). Free memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: -5.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,371 INFO L168 Benchmark]: Witness Printer took 97.75 ms. Allocated memory is still 10.3 GB. Free memory was 6.8 GB in the beginning and 6.7 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:24:11,373 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 461.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 291534.39 ms. Allocated memory was 1.2 GB in the beginning and 10.3 GB in the end (delta: 9.1 GB). Free memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: -5.7 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 97.75 ms. Allocated memory is still 10.3 GB. Free memory was 6.8 GB in the beginning and 6.7 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1213; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1214; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1215; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 291.4s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 98.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8967 SDtfs, 9367 SDslu, 19960 SDs, 0 SdLazy, 7853 SolverSat, 539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 96 SyntacticMatches, 15 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479331occurred in iteration=15, 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: 160.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 1448987 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2951 NumberOfCodeBlocks, 2951 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2813 ConstructedInterpolants, 0 QuantifiedInterpolants, 574404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...