./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/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 ffd67b86a2dfea5b1e5d645bc032c3da98c3f249 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:22:19,683 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:22:19,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:22:19,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:22:19,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:22:19,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:22:19,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:22:19,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:22:19,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:22:19,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:22:19,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:22:19,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:22:19,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:22:19,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:22:19,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:22:19,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:22:19,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:22:19,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:22:19,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:22:19,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:22:19,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:22:19,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:22:19,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:22:19,704 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:22:19,704 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:22:19,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:22:19,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:22:19,706 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:22:19,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:22:19,707 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:22:19,707 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:22:19,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:22:19,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:22:19,708 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:22:19,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:22:19,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:22:19,708 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 05:22:19,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:22:19,715 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:22:19,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:22:19,716 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:22:19,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:22:19,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:22:19,716 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:22:19,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:22:19,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:22:19,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:22:19,718 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:22:19,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:22:19,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:22:19,720 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_7e214d07-e685-4f12-a953-df7c4c8b8c6b/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 -> ffd67b86a2dfea5b1e5d645bc032c3da98c3f249 [2018-12-09 05:22:19,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:22:19,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:22:19,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:22:19,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:22:19,753 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:22:19,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i [2018-12-09 05:22:19,794 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/data/6e69d265a/f91df7a53a4f41a4b3383ce2a5a6e4ff/FLAGd8e683089 [2018-12-09 05:22:20,217 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:22:20,217 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i [2018-12-09 05:22:20,225 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/data/6e69d265a/f91df7a53a4f41a4b3383ce2a5a6e4ff/FLAGd8e683089 [2018-12-09 05:22:20,233 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/data/6e69d265a/f91df7a53a4f41a4b3383ce2a5a6e4ff [2018-12-09 05:22:20,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:22:20,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:22:20,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:22:20,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:22:20,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:22:20,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20, skipping insertion in model container [2018-12-09 05:22:20,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:22:20,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:22:20,443 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:22:20,503 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:22:20,540 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:22:20,574 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:22:20,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20 WrapperNode [2018-12-09 05:22:20,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:22:20,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:22:20,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:22:20,575 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:22:20,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:22:20,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:22:20,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:22:20,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:22:20,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... [2018-12-09 05:22:20,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:22:20,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:22:20,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:22:20,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:22:20,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/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-12-09 05:22:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:22:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:22:20,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 05:22:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 05:22:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 05:22:20,664 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 05:22:20,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:22:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:22:20,665 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 05:22:20,964 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:22:20,964 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:22:20,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:22:20 BoogieIcfgContainer [2018-12-09 05:22:20,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:22:20,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:22:20,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:22:20,967 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:22:20,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:22:20" (1/3) ... [2018-12-09 05:22:20,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:22:20, skipping insertion in model container [2018-12-09 05:22:20,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:22:20" (2/3) ... [2018-12-09 05:22:20,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:22:20, skipping insertion in model container [2018-12-09 05:22:20,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:22:20" (3/3) ... [2018-12-09 05:22:20,969 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc_false-unreach-call.i [2018-12-09 05:22:20,992 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,993 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,994 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,995 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,996 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,997 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:20,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 05:22:21,005 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 05:22:21,005 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:22:21,010 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 05:22:21,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 05:22:21,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:22:21,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:22:21,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:22:21,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:22:21,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:22:21,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:22:21,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:22:21,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:22:21,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:22:21,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 05:22:36,238 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 05:22:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 05:22:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 05:22:36,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:36,247 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] [2018-12-09 05:22:36,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:36,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 05:22:36,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:22:36,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:22:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:36,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:22:36,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:36,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:36,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:36,414 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 05:22:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:39,268 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 05:22:39,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:22:39,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 05:22:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:40,033 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 05:22:40,033 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 05:22:40,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 05:22:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 05:22:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 05:22:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 05:22:43,703 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 05:22:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:43,704 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 05:22:43,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:22:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 05:22:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 05:22:43,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:43,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:43,711 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:43,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 05:22:43,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:22:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:22:43,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:43,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:22:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:22:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:22:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:22:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:22:43,755 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 05:22:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:44,339 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 05:22:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:22:44,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 05:22:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:44,645 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 05:22:44,645 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 05:22:44,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:22:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 05:22:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 05:22:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 05:22:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 05:22:47,772 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 05:22:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:47,773 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 05:22:47,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:22:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 05:22:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 05:22:47,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:47,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:47,776 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:47,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 05:22:47,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:22:47,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:22:47,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:22:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:22:47,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:22:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:22:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:22:47,816 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 05:22:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:49,558 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 05:22:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:22:49,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 05:22:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:53,221 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 05:22:53,221 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 05:22:53,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:22:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 05:22:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 05:22:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 05:22:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 05:22:58,268 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 05:22:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:22:58,268 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 05:22:58,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:22:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 05:22:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 05:22:58,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:22:58,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:22:58,273 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:22:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:22:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 05:22:58,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:22:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:22:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:22:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:22:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:22:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:22:58,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:22:58,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:22:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:22:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:22:58,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:22:58,314 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-09 05:22:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:22:59,061 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-09 05:22:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:22:59,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 05:22:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:22:59,460 INFO L225 Difference]: With dead ends: 163598 [2018-12-09 05:22:59,460 INFO L226 Difference]: Without dead ends: 160993 [2018-12-09 05:22:59,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-09 05:23:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-09 05:23:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-09 05:23:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-09 05:23:06,035 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-09 05:23:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:06,035 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-09 05:23:06,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:23:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-09 05:23:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 05:23:06,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:06,040 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-12-09 05:23:06,040 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:06,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1667665363, now seen corresponding path program 1 times [2018-12-09 05:23:06,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:06,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:06,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:06,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:06,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:06,079 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-09 05:23:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:06,282 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-09 05:23:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:06,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 05:23:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:06,377 INFO L225 Difference]: With dead ends: 51405 [2018-12-09 05:23:06,377 INFO L226 Difference]: Without dead ends: 49093 [2018-12-09 05:23:06,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-09 05:23:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-09 05:23:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-09 05:23:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-09 05:23:07,097 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-09 05:23:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:07,097 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-09 05:23:07,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-09 05:23:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 05:23:07,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:07,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:07,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:07,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 503624572, now seen corresponding path program 1 times [2018-12-09 05:23:07,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:07,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:07,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:07,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:07,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:23:07,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:23:07,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:23:07,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:07,157 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-09 05:23:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:07,496 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-09 05:23:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:07,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 05:23:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:07,634 INFO L225 Difference]: With dead ends: 70361 [2018-12-09 05:23:07,634 INFO L226 Difference]: Without dead ends: 70361 [2018-12-09 05:23:07,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-09 05:23:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-09 05:23:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-09 05:23:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-09 05:23:08,670 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-09 05:23:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:08,670 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-09 05:23:08,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:23:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-09 05:23:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 05:23:08,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:08,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:08,683 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:08,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2048532389, now seen corresponding path program 1 times [2018-12-09 05:23:08,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:08,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-12-09 05:23:08,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:08,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:08,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:08,734 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-09 05:23:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:08,801 INFO L93 Difference]: Finished difference Result 11001 states and 37616 transitions. [2018-12-09 05:23:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:23:08,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 05:23:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:08,813 INFO L225 Difference]: With dead ends: 11001 [2018-12-09 05:23:08,813 INFO L226 Difference]: Without dead ends: 9289 [2018-12-09 05:23:08,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:23:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-09 05:23:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2018-12-09 05:23:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-12-09 05:23:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29920 transitions. [2018-12-09 05:23:08,906 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29920 transitions. Word has length 65 [2018-12-09 05:23:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:08,907 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29920 transitions. [2018-12-09 05:23:08,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29920 transitions. [2018-12-09 05:23:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:08,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:08,916 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] [2018-12-09 05:23:08,916 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:08,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 877472604, now seen corresponding path program 1 times [2018-12-09 05:23:08,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:08,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:08,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:08,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:23:08,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:23:08,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:23:08,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:08,957 INFO L87 Difference]: Start difference. First operand 8774 states and 29920 transitions. Second operand 3 states. [2018-12-09 05:23:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:09,066 INFO L93 Difference]: Finished difference Result 9194 states and 31201 transitions. [2018-12-09 05:23:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:23:09,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 05:23:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:09,079 INFO L225 Difference]: With dead ends: 9194 [2018-12-09 05:23:09,079 INFO L226 Difference]: Without dead ends: 9194 [2018-12-09 05:23:09,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:23:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2018-12-09 05:23:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2018-12-09 05:23:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2018-12-09 05:23:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30502 transitions. [2018-12-09 05:23:09,171 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30502 transitions. Word has length 98 [2018-12-09 05:23:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:09,171 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30502 transitions. [2018-12-09 05:23:09,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:23:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30502 transitions. [2018-12-09 05:23:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:09,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:09,181 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] [2018-12-09 05:23:09,181 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:09,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -255717989, now seen corresponding path program 1 times [2018-12-09 05:23:09,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:09,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:09,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:09,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:23:09,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:23:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:23:09,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:09,224 INFO L87 Difference]: Start difference. First operand 8964 states and 30502 transitions. Second operand 4 states. [2018-12-09 05:23:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:09,380 INFO L93 Difference]: Finished difference Result 13969 states and 47679 transitions. [2018-12-09 05:23:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:23:09,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 05:23:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:09,397 INFO L225 Difference]: With dead ends: 13969 [2018-12-09 05:23:09,397 INFO L226 Difference]: Without dead ends: 13969 [2018-12-09 05:23:09,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13969 states. [2018-12-09 05:23:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13969 to 9164. [2018-12-09 05:23:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-09 05:23:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 31112 transitions. [2018-12-09 05:23:09,514 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 31112 transitions. Word has length 98 [2018-12-09 05:23:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:09,514 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 31112 transitions. [2018-12-09 05:23:09,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:23:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 31112 transitions. [2018-12-09 05:23:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:09,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:09,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:09,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:09,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1050811619, now seen corresponding path program 2 times [2018-12-09 05:23:09,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:09,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:09,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:09,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:09,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:09,567 INFO L87 Difference]: Start difference. First operand 9164 states and 31112 transitions. Second operand 5 states. [2018-12-09 05:23:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:09,729 INFO L93 Difference]: Finished difference Result 13300 states and 44194 transitions. [2018-12-09 05:23:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:09,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 05:23:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:09,744 INFO L225 Difference]: With dead ends: 13300 [2018-12-09 05:23:09,744 INFO L226 Difference]: Without dead ends: 13300 [2018-12-09 05:23:09,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13300 states. [2018-12-09 05:23:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13300 to 9784. [2018-12-09 05:23:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9784 states. [2018-12-09 05:23:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9784 states to 9784 states and 33183 transitions. [2018-12-09 05:23:09,857 INFO L78 Accepts]: Start accepts. Automaton has 9784 states and 33183 transitions. Word has length 98 [2018-12-09 05:23:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:09,858 INFO L480 AbstractCegarLoop]: Abstraction has 9784 states and 33183 transitions. [2018-12-09 05:23:09,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9784 states and 33183 transitions. [2018-12-09 05:23:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:09,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:09,869 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] [2018-12-09 05:23:09,869 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:09,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:09,869 INFO L82 PathProgramCache]: Analyzing trace with hash 26117698, now seen corresponding path program 1 times [2018-12-09 05:23:09,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:09,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:09,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:23:09,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:09,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:09,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:09,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:09,929 INFO L87 Difference]: Start difference. First operand 9784 states and 33183 transitions. Second operand 7 states. [2018-12-09 05:23:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,239 INFO L93 Difference]: Finished difference Result 12224 states and 40725 transitions. [2018-12-09 05:23:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:10,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-09 05:23:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,252 INFO L225 Difference]: With dead ends: 12224 [2018-12-09 05:23:10,252 INFO L226 Difference]: Without dead ends: 12179 [2018-12-09 05:23:10,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2018-12-09 05:23:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 11114. [2018-12-09 05:23:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2018-12-09 05:23:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 37497 transitions. [2018-12-09 05:23:10,369 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 37497 transitions. Word has length 98 [2018-12-09 05:23:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,369 INFO L480 AbstractCegarLoop]: Abstraction has 11114 states and 37497 transitions. [2018-12-09 05:23:10,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 37497 transitions. [2018-12-09 05:23:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:10,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:10,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:10,381 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:10,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:10,381 INFO L82 PathProgramCache]: Analyzing trace with hash -813781119, now seen corresponding path program 3 times [2018-12-09 05:23:10,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:10,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:10,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:10,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:10,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:10,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:10,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:10,424 INFO L87 Difference]: Start difference. First operand 11114 states and 37497 transitions. Second operand 5 states. [2018-12-09 05:23:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:10,653 INFO L93 Difference]: Finished difference Result 12159 states and 40613 transitions. [2018-12-09 05:23:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:23:10,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 05:23:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:10,666 INFO L225 Difference]: With dead ends: 12159 [2018-12-09 05:23:10,667 INFO L226 Difference]: Without dead ends: 12159 [2018-12-09 05:23:10,667 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-12-09 05:23:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12159 states. [2018-12-09 05:23:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12159 to 11234. [2018-12-09 05:23:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11234 states. [2018-12-09 05:23:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11234 states to 11234 states and 37833 transitions. [2018-12-09 05:23:10,779 INFO L78 Accepts]: Start accepts. Automaton has 11234 states and 37833 transitions. Word has length 98 [2018-12-09 05:23:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:10,779 INFO L480 AbstractCegarLoop]: Abstraction has 11234 states and 37833 transitions. [2018-12-09 05:23:10,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11234 states and 37833 transitions. [2018-12-09 05:23:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:23:10,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:10,790 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] [2018-12-09 05:23:10,790 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:10,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1997057155, now seen corresponding path program 1 times [2018-12-09 05:23:10,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:23:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:10,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:10,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:10,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:10,844 INFO L87 Difference]: Start difference. First operand 11234 states and 37833 transitions. Second operand 5 states. [2018-12-09 05:23:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:11,023 INFO L93 Difference]: Finished difference Result 15305 states and 50373 transitions. [2018-12-09 05:23:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:11,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 05:23:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:11,046 INFO L225 Difference]: With dead ends: 15305 [2018-12-09 05:23:11,046 INFO L226 Difference]: Without dead ends: 15165 [2018-12-09 05:23:11,047 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-12-09 05:23:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15165 states. [2018-12-09 05:23:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15165 to 11494. [2018-12-09 05:23:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11494 states. [2018-12-09 05:23:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11494 states to 11494 states and 38501 transitions. [2018-12-09 05:23:11,177 INFO L78 Accepts]: Start accepts. Automaton has 11494 states and 38501 transitions. Word has length 98 [2018-12-09 05:23:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:11,177 INFO L480 AbstractCegarLoop]: Abstraction has 11494 states and 38501 transitions. [2018-12-09 05:23:11,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 11494 states and 38501 transitions. [2018-12-09 05:23:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:11,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:11,187 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-12-09 05:23:11,187 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:11,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1564298, now seen corresponding path program 1 times [2018-12-09 05:23:11,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:11,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:11,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:11,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:23:11,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:23:11,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:23:11,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:11,230 INFO L87 Difference]: Start difference. First operand 11494 states and 38501 transitions. Second operand 4 states. [2018-12-09 05:23:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:11,359 INFO L93 Difference]: Finished difference Result 17920 states and 60397 transitions. [2018-12-09 05:23:11,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:23:11,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 05:23:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:11,380 INFO L225 Difference]: With dead ends: 17920 [2018-12-09 05:23:11,380 INFO L226 Difference]: Without dead ends: 17920 [2018-12-09 05:23:11,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17920 states. [2018-12-09 05:23:11,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17920 to 9819. [2018-12-09 05:23:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2018-12-09 05:23:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32796 transitions. [2018-12-09 05:23:11,520 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32796 transitions. Word has length 100 [2018-12-09 05:23:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 9819 states and 32796 transitions. [2018-12-09 05:23:11,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:23:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32796 transitions. [2018-12-09 05:23:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:11,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:11,531 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-12-09 05:23:11,531 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:11,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:11,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1184911595, now seen corresponding path program 1 times [2018-12-09 05:23:11,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:11,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:11,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:11,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:11,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:11,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:11,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:11,608 INFO L87 Difference]: Start difference. First operand 9819 states and 32796 transitions. Second operand 6 states. [2018-12-09 05:23:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:11,803 INFO L93 Difference]: Finished difference Result 11694 states and 38496 transitions. [2018-12-09 05:23:11,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:11,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:23:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:11,815 INFO L225 Difference]: With dead ends: 11694 [2018-12-09 05:23:11,815 INFO L226 Difference]: Without dead ends: 11694 [2018-12-09 05:23:11,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11694 states. [2018-12-09 05:23:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11694 to 10164. [2018-12-09 05:23:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10164 states. [2018-12-09 05:23:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10164 states to 10164 states and 33907 transitions. [2018-12-09 05:23:11,919 INFO L78 Accepts]: Start accepts. Automaton has 10164 states and 33907 transitions. Word has length 100 [2018-12-09 05:23:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:11,919 INFO L480 AbstractCegarLoop]: Abstraction has 10164 states and 33907 transitions. [2018-12-09 05:23:11,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10164 states and 33907 transitions. [2018-12-09 05:23:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:11,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:11,928 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-12-09 05:23:11,928 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:11,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:11,928 INFO L82 PathProgramCache]: Analyzing trace with hash -215330572, now seen corresponding path program 1 times [2018-12-09 05:23:11,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:11,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:11,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:11,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:11,997 INFO L87 Difference]: Start difference. First operand 10164 states and 33907 transitions. Second operand 6 states. [2018-12-09 05:23:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:12,186 INFO L93 Difference]: Finished difference Result 9333 states and 30729 transitions. [2018-12-09 05:23:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:12,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:23:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:12,196 INFO L225 Difference]: With dead ends: 9333 [2018-12-09 05:23:12,196 INFO L226 Difference]: Without dead ends: 9333 [2018-12-09 05:23:12,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9333 states. [2018-12-09 05:23:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9333 to 8974. [2018-12-09 05:23:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8974 states. [2018-12-09 05:23:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 29675 transitions. [2018-12-09 05:23:12,285 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 29675 transitions. Word has length 100 [2018-12-09 05:23:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:12,285 INFO L480 AbstractCegarLoop]: Abstraction has 8974 states and 29675 transitions. [2018-12-09 05:23:12,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 29675 transitions. [2018-12-09 05:23:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:12,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:12,293 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-12-09 05:23:12,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:12,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 866833783, now seen corresponding path program 1 times [2018-12-09 05:23:12,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:12,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:12,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:12,348 INFO L87 Difference]: Start difference. First operand 8974 states and 29675 transitions. Second operand 6 states. [2018-12-09 05:23:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:12,559 INFO L93 Difference]: Finished difference Result 10194 states and 32931 transitions. [2018-12-09 05:23:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:23:12,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:23:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:12,569 INFO L225 Difference]: With dead ends: 10194 [2018-12-09 05:23:12,569 INFO L226 Difference]: Without dead ends: 9839 [2018-12-09 05:23:12,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2018-12-09 05:23:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 9154. [2018-12-09 05:23:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2018-12-09 05:23:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 30059 transitions. [2018-12-09 05:23:12,660 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 30059 transitions. Word has length 100 [2018-12-09 05:23:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:12,660 INFO L480 AbstractCegarLoop]: Abstraction has 9154 states and 30059 transitions. [2018-12-09 05:23:12,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 30059 transitions. [2018-12-09 05:23:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:12,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:12,668 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-12-09 05:23:12,668 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:12,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:12,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1727393034, now seen corresponding path program 1 times [2018-12-09 05:23:12,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:12,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:12,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:12,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:12,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:12,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:12,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:12,717 INFO L87 Difference]: Start difference. First operand 9154 states and 30059 transitions. Second operand 7 states. [2018-12-09 05:23:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:12,954 INFO L93 Difference]: Finished difference Result 10117 states and 33155 transitions. [2018-12-09 05:23:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:23:12,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 05:23:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:12,965 INFO L225 Difference]: With dead ends: 10117 [2018-12-09 05:23:12,965 INFO L226 Difference]: Without dead ends: 10117 [2018-12-09 05:23:12,965 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-12-09 05:23:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2018-12-09 05:23:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 9069. [2018-12-09 05:23:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9069 states. [2018-12-09 05:23:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 29811 transitions. [2018-12-09 05:23:13,060 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 29811 transitions. Word has length 100 [2018-12-09 05:23:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:13,061 INFO L480 AbstractCegarLoop]: Abstraction has 9069 states and 29811 transitions. [2018-12-09 05:23:13,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 29811 transitions. [2018-12-09 05:23:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:13,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:13,069 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-12-09 05:23:13,069 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:13,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:13,069 INFO L82 PathProgramCache]: Analyzing trace with hash -316513514, now seen corresponding path program 1 times [2018-12-09 05:23:13,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:13,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:13,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,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-12-09 05:23:13,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:13,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:13,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:13,131 INFO L87 Difference]: Start difference. First operand 9069 states and 29811 transitions. Second operand 5 states. [2018-12-09 05:23:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:13,213 INFO L93 Difference]: Finished difference Result 8217 states and 26961 transitions. [2018-12-09 05:23:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:23:13,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 05:23:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:13,222 INFO L225 Difference]: With dead ends: 8217 [2018-12-09 05:23:13,223 INFO L226 Difference]: Without dead ends: 8217 [2018-12-09 05:23:13,223 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-12-09 05:23:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-09 05:23:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8032. [2018-12-09 05:23:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2018-12-09 05:23:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 26443 transitions. [2018-12-09 05:23:13,299 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 26443 transitions. Word has length 100 [2018-12-09 05:23:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:13,300 INFO L480 AbstractCegarLoop]: Abstraction has 8032 states and 26443 transitions. [2018-12-09 05:23:13,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 26443 transitions. [2018-12-09 05:23:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:13,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:13,306 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-12-09 05:23:13,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:13,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2042793495, now seen corresponding path program 1 times [2018-12-09 05:23:13,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:13,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:13,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:23:13,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:23:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:23:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:13,368 INFO L87 Difference]: Start difference. First operand 8032 states and 26443 transitions. Second operand 4 states. [2018-12-09 05:23:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:13,443 INFO L93 Difference]: Finished difference Result 9376 states and 31131 transitions. [2018-12-09 05:23:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:23:13,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 05:23:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:13,454 INFO L225 Difference]: With dead ends: 9376 [2018-12-09 05:23:13,454 INFO L226 Difference]: Without dead ends: 9376 [2018-12-09 05:23:13,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:23:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2018-12-09 05:23:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9248. [2018-12-09 05:23:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-09 05:23:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-09 05:23:13,547 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-09 05:23:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:13,547 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-09 05:23:13,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:23:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-09 05:23:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 05:23:13,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:13,556 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-12-09 05:23:13,556 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:13,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash -34415848, now seen corresponding path program 1 times [2018-12-09 05:23:13,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:13,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:13,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:13,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:13,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:13,638 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-09 05:23:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:13,714 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-09 05:23:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:23:13,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 05:23:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:13,723 INFO L225 Difference]: With dead ends: 8096 [2018-12-09 05:23:13,723 INFO L226 Difference]: Without dead ends: 8096 [2018-12-09 05:23:13,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-09 05:23:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-09 05:23:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-09 05:23:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-09 05:23:13,793 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-09 05:23:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:13,794 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-09 05:23:13,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-09 05:23:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:13,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:13,800 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-12-09 05:23:13,800 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:13,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 05:23:13,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:13,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:13,852 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-09 05:23:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:14,150 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-09 05:23:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 05:23:14,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:23:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:14,163 INFO L225 Difference]: With dead ends: 12218 [2018-12-09 05:23:14,163 INFO L226 Difference]: Without dead ends: 12218 [2018-12-09 05:23:14,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:23:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-09 05:23:14,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-09 05:23:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-09 05:23:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-09 05:23:14,271 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-09 05:23:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:14,271 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-09 05:23:14,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-09 05:23:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:14,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:14,279 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-12-09 05:23:14,280 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:14,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 05:23:14,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:14,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:14,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:14,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:14,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:14,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:14,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:14,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:14,345 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-09 05:23:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:14,432 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-09 05:23:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:23:14,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 05:23:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:14,443 INFO L225 Difference]: With dead ends: 9843 [2018-12-09 05:23:14,443 INFO L226 Difference]: Without dead ends: 9843 [2018-12-09 05:23:14,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:23:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-09 05:23:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-09 05:23:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 05:23:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-09 05:23:14,539 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-09 05:23:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:14,540 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-09 05:23:14,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-09 05:23:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:14,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:14,549 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-12-09 05:23:14,549 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:14,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 05:23:14,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:14,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:14,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:14,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:23:14,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:23:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:23:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:23:14,605 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-09 05:23:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:14,725 INFO L93 Difference]: Finished difference Result 17910 states and 59425 transitions. [2018-12-09 05:23:14,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:23:14,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 05:23:14,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:14,747 INFO L225 Difference]: With dead ends: 17910 [2018-12-09 05:23:14,747 INFO L226 Difference]: Without dead ends: 17910 [2018-12-09 05:23:14,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 05:23:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-12-09 05:23:14,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 9898. [2018-12-09 05:23:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9898 states. [2018-12-09 05:23:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9898 states to 9898 states and 32205 transitions. [2018-12-09 05:23:14,885 INFO L78 Accepts]: Start accepts. Automaton has 9898 states and 32205 transitions. Word has length 102 [2018-12-09 05:23:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:14,886 INFO L480 AbstractCegarLoop]: Abstraction has 9898 states and 32205 transitions. [2018-12-09 05:23:14,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:23:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 9898 states and 32205 transitions. [2018-12-09 05:23:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:14,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:14,895 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-12-09 05:23:14,895 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:14,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:14,896 INFO L82 PathProgramCache]: Analyzing trace with hash -668679505, now seen corresponding path program 1 times [2018-12-09 05:23:14,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:14,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:14,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:14,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:23:14,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:23:14,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:23:14,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:23:14,946 INFO L87 Difference]: Start difference. First operand 9898 states and 32205 transitions. Second operand 5 states. [2018-12-09 05:23:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:15,064 INFO L93 Difference]: Finished difference Result 11178 states and 36365 transitions. [2018-12-09 05:23:15,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:23:15,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 05:23:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:15,075 INFO L225 Difference]: With dead ends: 11178 [2018-12-09 05:23:15,076 INFO L226 Difference]: Without dead ends: 11178 [2018-12-09 05:23:15,076 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-12-09 05:23:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11178 states. [2018-12-09 05:23:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11178 to 8740. [2018-12-09 05:23:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8740 states. [2018-12-09 05:23:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8740 states to 8740 states and 28544 transitions. [2018-12-09 05:23:15,173 INFO L78 Accepts]: Start accepts. Automaton has 8740 states and 28544 transitions. Word has length 102 [2018-12-09 05:23:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:15,173 INFO L480 AbstractCegarLoop]: Abstraction has 8740 states and 28544 transitions. [2018-12-09 05:23:15,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:23:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 8740 states and 28544 transitions. [2018-12-09 05:23:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:15,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:15,181 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-12-09 05:23:15,181 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:15,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 576084976, now seen corresponding path program 1 times [2018-12-09 05:23:15,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:15,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:15,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:15,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 05:23:15,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:23:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:23:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:23:15,271 INFO L87 Difference]: Start difference. First operand 8740 states and 28544 transitions. Second operand 10 states. [2018-12-09 05:23:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:15,583 INFO L93 Difference]: Finished difference Result 16456 states and 54151 transitions. [2018-12-09 05:23:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:23:15,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 05:23:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:15,592 INFO L225 Difference]: With dead ends: 16456 [2018-12-09 05:23:15,592 INFO L226 Difference]: Without dead ends: 8048 [2018-12-09 05:23:15,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:23:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8048 states. [2018-12-09 05:23:15,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8048 to 8048. [2018-12-09 05:23:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8048 states. [2018-12-09 05:23:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8048 states to 8048 states and 26504 transitions. [2018-12-09 05:23:15,671 INFO L78 Accepts]: Start accepts. Automaton has 8048 states and 26504 transitions. Word has length 102 [2018-12-09 05:23:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:15,671 INFO L480 AbstractCegarLoop]: Abstraction has 8048 states and 26504 transitions. [2018-12-09 05:23:15,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:23:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8048 states and 26504 transitions. [2018-12-09 05:23:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:15,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:15,679 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-12-09 05:23:15,679 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:15,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1577961002, now seen corresponding path program 2 times [2018-12-09 05:23:15,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:15,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:15,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:15,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:15,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:15,738 INFO L87 Difference]: Start difference. First operand 8048 states and 26504 transitions. Second operand 7 states. [2018-12-09 05:23:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:15,924 INFO L93 Difference]: Finished difference Result 14658 states and 49083 transitions. [2018-12-09 05:23:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 05:23:15,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:23:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:15,932 INFO L225 Difference]: With dead ends: 14658 [2018-12-09 05:23:15,932 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 05:23:15,932 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-12-09 05:23:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 05:23:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-09 05:23:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-09 05:23:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23131 transitions. [2018-12-09 05:23:15,999 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23131 transitions. Word has length 102 [2018-12-09 05:23:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:15,999 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23131 transitions. [2018-12-09 05:23:15,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23131 transitions. [2018-12-09 05:23:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:16,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:16,006 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-12-09 05:23:16,006 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:16,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-09 05:23:16,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:16,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:23:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:16,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:16,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:16,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:16,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:16,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:16,076 INFO L87 Difference]: Start difference. First operand 6821 states and 23131 transitions. Second operand 7 states. [2018-12-09 05:23:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:16,301 INFO L93 Difference]: Finished difference Result 8957 states and 29585 transitions. [2018-12-09 05:23:16,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:23:16,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:23:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:16,311 INFO L225 Difference]: With dead ends: 8957 [2018-12-09 05:23:16,311 INFO L226 Difference]: Without dead ends: 8821 [2018-12-09 05:23:16,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:23:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2018-12-09 05:23:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 6805. [2018-12-09 05:23:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6805 states. [2018-12-09 05:23:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6805 states to 6805 states and 23039 transitions. [2018-12-09 05:23:16,406 INFO L78 Accepts]: Start accepts. Automaton has 6805 states and 23039 transitions. Word has length 102 [2018-12-09 05:23:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:16,406 INFO L480 AbstractCegarLoop]: Abstraction has 6805 states and 23039 transitions. [2018-12-09 05:23:16,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 6805 states and 23039 transitions. [2018-12-09 05:23:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:16,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:16,412 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-12-09 05:23:16,412 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:16,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:16,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-09 05:23:16,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:16,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:16,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:16,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:16,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:23:16,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:23:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:23:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:23:16,461 INFO L87 Difference]: Start difference. First operand 6805 states and 23039 transitions. Second operand 7 states. [2018-12-09 05:23:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:16,618 INFO L93 Difference]: Finished difference Result 13593 states and 46438 transitions. [2018-12-09 05:23:16,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:23:16,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 05:23:16,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:16,637 INFO L225 Difference]: With dead ends: 13593 [2018-12-09 05:23:16,637 INFO L226 Difference]: Without dead ends: 13593 [2018-12-09 05:23:16,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:23:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2018-12-09 05:23:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 6965. [2018-12-09 05:23:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6965 states. [2018-12-09 05:23:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 23455 transitions. [2018-12-09 05:23:16,736 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 23455 transitions. Word has length 102 [2018-12-09 05:23:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:16,737 INFO L480 AbstractCegarLoop]: Abstraction has 6965 states and 23455 transitions. [2018-12-09 05:23:16,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:23:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 23455 transitions. [2018-12-09 05:23:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:16,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:16,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:23:16,743 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-09 05:23:16,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:23:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:23:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:23:16,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:23:16,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 05:23:16,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 05:23:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 05:23:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:23:16,842 INFO L87 Difference]: Start difference. First operand 6965 states and 23455 transitions. Second operand 12 states. [2018-12-09 05:23:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:23:17,189 INFO L93 Difference]: Finished difference Result 13529 states and 45706 transitions. [2018-12-09 05:23:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:23:17,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 05:23:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:23:17,200 INFO L225 Difference]: With dead ends: 13529 [2018-12-09 05:23:17,200 INFO L226 Difference]: Without dead ends: 9625 [2018-12-09 05:23:17,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:23:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2018-12-09 05:23:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 9017. [2018-12-09 05:23:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9017 states. [2018-12-09 05:23:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 29626 transitions. [2018-12-09 05:23:17,294 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 29626 transitions. Word has length 102 [2018-12-09 05:23:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:23:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 9017 states and 29626 transitions. [2018-12-09 05:23:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 05:23:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 29626 transitions. [2018-12-09 05:23:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:23:17,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:23:17,302 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-12-09 05:23:17,302 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:23:17,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:23:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1730295936, now seen corresponding path program 4 times [2018-12-09 05:23:17,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:23:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:23:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:17,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:23:17,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:23:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:23:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:23:17,347 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:23:17,443 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 05:23:17,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:23:17 BasicIcfg [2018-12-09 05:23:17,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:23:17,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:23:17,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:23:17,445 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:23:17,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:22:20" (3/4) ... [2018-12-09 05:23:17,447 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:23:17,534 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7e214d07-e685-4f12-a953-df7c4c8b8c6b/bin-2019/uautomizer/witness.graphml [2018-12-09 05:23:17,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:23:17,535 INFO L168 Benchmark]: Toolchain (without parser) took 57299.65 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.4 GB). Free memory was 949.5 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,536 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:23:17,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,536 INFO L168 Benchmark]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:23:17,537 INFO L168 Benchmark]: RCFGBuilder took 332.85 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,537 INFO L168 Benchmark]: TraceAbstraction took 56480.02 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,537 INFO L168 Benchmark]: Witness Printer took 89.03 ms. Allocated memory is still 7.4 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:23:17,538 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.85 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56480.02 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 89.03 ms. Allocated memory is still 7.4 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 36.4 MB). Peak memory consumption was 36.4 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] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L776] -1 pthread_t t1509; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L777] FCALL, FORK -1 pthread_create(&t1509, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L778] -1 pthread_t t1510; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L779] FCALL, FORK -1 pthread_create(&t1510, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L780] -1 pthread_t t1511; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L781] FCALL, FORK -1 pthread_create(&t1511, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=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] [L754] 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=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=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] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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] [L725] 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=0, 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] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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] [L725] 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=0, 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] [L725] 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) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] 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=0, 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] [L727] 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 [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 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) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] 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=0, 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$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 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 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] 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=2, __unbuffered_p2_EAX=0, 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] [L756] 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 [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, 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] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] 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=2, __unbuffered_p2_EAX=0, 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] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L787] 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=0, 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] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L787] 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=0, 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] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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=0, 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] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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=0, 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] [L791] -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 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L798] 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=0, 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] [L798] -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) [L799] 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=0, 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] [L799] -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)) [L800] 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=0, 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] [L800] -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)) [L801] 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=0, 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] [L801] -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)) [L802] 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=0, 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] [L802] -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)) [L803] 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=0, 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] [L803] -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)) [L804] 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=0, 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] [L804] -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)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=0, 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=0, 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, 198 locations, 3 error locations. UNSAFE Result, 56.4s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6587 SDtfs, 6382 SDslu, 15420 SDs, 0 SdLazy, 5417 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 88 SyntacticMatches, 20 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, 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: 22.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 290104 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2784 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2652 ConstructedInterpolants, 0 QuantifiedInterpolants, 568696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...