./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_pso.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_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/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 aa34029f8330b35f84f4d1fd49a98940754a0969 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-01 14:04:59,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:04:59,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:04:59,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:04:59,694 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:04:59,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:04:59,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:04:59,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:04:59,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:04:59,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:04:59,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:04:59,699 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:04:59,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:04:59,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:04:59,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:04:59,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:04:59,702 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:04:59,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:04:59,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:04:59,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:04:59,706 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:04:59,707 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:04:59,709 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:04:59,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:04:59,709 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:04:59,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:04:59,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:04:59,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:04:59,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:04:59,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:04:59,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:04:59,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:04:59,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:04:59,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:04:59,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:04:59,714 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:04:59,714 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 14:04:59,724 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:04:59,724 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:04:59,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 14:04:59,724 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 14:04:59,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:04:59,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:04:59,725 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:04:59,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:04:59,725 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:04:59,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 14:04:59,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 14:04:59,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:04:59,727 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 14:04:59,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 14:04:59,728 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_6394025f-742a-4d44-9b65-16c481429268/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 -> aa34029f8330b35f84f4d1fd49a98940754a0969 [2018-12-01 14:04:59,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:04:59,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:04:59,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:04:59,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:04:59,759 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:04:59,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_pso.oepc_false-unreach-call.i [2018-12-01 14:04:59,792 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/data/7320a4ea9/7d261b1016304592859577954b2577c4/FLAGc98d27069 [2018-12-01 14:05:00,116 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:05:00,116 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/sv-benchmarks/c/pthread-wmm/safe022_pso.oepc_false-unreach-call.i [2018-12-01 14:05:00,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/data/7320a4ea9/7d261b1016304592859577954b2577c4/FLAGc98d27069 [2018-12-01 14:05:00,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/data/7320a4ea9/7d261b1016304592859577954b2577c4 [2018-12-01 14:05:00,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:05:00,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:05:00,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:05:00,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:05:00,526 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:05:00,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4251d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00, skipping insertion in model container [2018-12-01 14:05:00,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:05:00,559 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:05:00,748 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:05:00,756 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:05:00,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:05:00,858 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:05:00,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00 WrapperNode [2018-12-01 14:05:00,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:05:00,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:05:00,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:05:00,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:05:00,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:05:00,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:05:00,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:05:00,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:05:00,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... [2018-12-01 14:05:00,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:05:00,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:05:00,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:05:00,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:05:00,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/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-01 14:05:00,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 14:05:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 14:05:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 14:05:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 14:05:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 14:05:00,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 14:05:00,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 14:05:00,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 14:05:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 14:05:00,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:05:00,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:05:00,953 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 14:05:01,267 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:05:01,267 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 14:05:01,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:05:01 BoogieIcfgContainer [2018-12-01 14:05:01,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:05:01,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 14:05:01,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 14:05:01,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 14:05:01,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 02:05:00" (1/3) ... [2018-12-01 14:05:01,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1468ea2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:05:01, skipping insertion in model container [2018-12-01 14:05:01,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:05:00" (2/3) ... [2018-12-01 14:05:01,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1468ea2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:05:01, skipping insertion in model container [2018-12-01 14:05:01,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:05:01" (3/3) ... [2018-12-01 14:05:01,272 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_pso.oepc_false-unreach-call.i [2018-12-01 14:05:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,295 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,296 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,297 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,298 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,301 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,302 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,303 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,304 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,305 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,306 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,307 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,308 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,309 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 14:05:01,313 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 14:05:01,313 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 14:05:01,318 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 14:05:01,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 14:05:01,341 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:05:01,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 14:05:01,342 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 14:05:01,342 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 14:05:01,342 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:05:01,342 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:05:01,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 14:05:01,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:05:01,342 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 14:05:01,348 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-01 14:05:02,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-01 14:05:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-01 14:05:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 14:05:02,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:02,733 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] [2018-12-01 14:05:02,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:02,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash -454041356, now seen corresponding path program 1 times [2018-12-01 14:05:02,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:02,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:02,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:02,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:02,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:02,868 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-01 14:05:02,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:02,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:02,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:02,886 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-01 14:05:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:03,424 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-01 14:05:03,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:05:03,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-01 14:05:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:03,584 INFO L225 Difference]: With dead ends: 60790 [2018-12-01 14:05:03,584 INFO L226 Difference]: Without dead ends: 44270 [2018-12-01 14:05:03,586 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-01 14:05:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-01 14:05:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-01 14:05:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-01 14:05:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-01 14:05:04,333 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-01 14:05:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:04,333 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-01 14:05:04,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-01 14:05:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 14:05:04,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:04,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:04,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:04,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1863363909, now seen corresponding path program 1 times [2018-12-01 14:05:04,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:04,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:04,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:04,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:04,392 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-01 14:05:04,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:04,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:04,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:04,394 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-01 14:05:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:04,476 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-01 14:05:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:05:04,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-01 14:05:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:04,498 INFO L225 Difference]: With dead ends: 8528 [2018-12-01 14:05:04,498 INFO L226 Difference]: Without dead ends: 7466 [2018-12-01 14:05:04,499 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-01 14:05:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-01 14:05:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-01 14:05:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-01 14:05:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-01 14:05:04,598 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-01 14:05:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:04,598 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-01 14:05:04,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-01 14:05:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-01 14:05:04,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:04,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:04,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:04,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash 591681941, now seen corresponding path program 1 times [2018-12-01 14:05:04,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:04,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:04,649 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-01 14:05:04,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:04,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:04,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:04,651 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-01 14:05:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:04,883 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-01 14:05:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:04,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-01 14:05:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:04,910 INFO L225 Difference]: With dead ends: 13998 [2018-12-01 14:05:04,911 INFO L226 Difference]: Without dead ends: 13930 [2018-12-01 14:05:04,911 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-01 14:05:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-01 14:05:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-01 14:05:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-01 14:05:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-01 14:05:05,106 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-01 14:05:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:05,107 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-01 14:05:05,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-01 14:05:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 14:05:05,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:05,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:05,109 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:05,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:05,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1652121253, now seen corresponding path program 1 times [2018-12-01 14:05:05,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:05,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:05,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:05:05,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:05,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:05:05,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:05:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:05:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:05:05,143 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-01 14:05:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:05,194 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-01 14:05:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:05:05,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-01 14:05:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:05,210 INFO L225 Difference]: With dead ends: 13279 [2018-12-01 14:05:05,210 INFO L226 Difference]: Without dead ends: 13279 [2018-12-01 14:05:05,210 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-01 14:05:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-01 14:05:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-01 14:05:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-01 14:05:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-01 14:05:05,328 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-01 14:05:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:05,329 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-01 14:05:05,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:05:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-01 14:05:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-01 14:05:05,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:05,330 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-01 14:05:05,330 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:05,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash -164023066, now seen corresponding path program 1 times [2018-12-01 14:05:05,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:05,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:05,386 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-01 14:05:05,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:05,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:05:05,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:05:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:05:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:05,387 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-01 14:05:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:05,788 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-01 14:05:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 14:05:05,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-01 14:05:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:05,801 INFO L225 Difference]: With dead ends: 12285 [2018-12-01 14:05:05,801 INFO L226 Difference]: Without dead ends: 12213 [2018-12-01 14:05:05,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-01 14:05:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-01 14:05:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-01 14:05:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-01 14:05:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-01 14:05:05,914 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-01 14:05:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:05,915 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-01 14:05:05,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:05:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-01 14:05:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 14:05:05,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:05,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:05,919 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:05,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:05,919 INFO L82 PathProgramCache]: Analyzing trace with hash 317195842, now seen corresponding path program 1 times [2018-12-01 14:05:05,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:05,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:05,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:05,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:05,964 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-01 14:05:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:05,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:05,965 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-01 14:05:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:06,100 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-01 14:05:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:05:06,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-01 14:05:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:06,114 INFO L225 Difference]: With dead ends: 12396 [2018-12-01 14:05:06,114 INFO L226 Difference]: Without dead ends: 12396 [2018-12-01 14:05:06,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-01 14:05:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-01 14:05:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-01 14:05:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-01 14:05:06,233 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-01 14:05:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:06,233 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-01 14:05:06,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-01 14:05:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-01 14:05:06,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:06,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:06,236 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:06,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2060006177, now seen corresponding path program 1 times [2018-12-01 14:05:06,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:06,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:06,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:06,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:05:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:06,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:06,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:06,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:06,294 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-01 14:05:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:06,574 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-01 14:05:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 14:05:06,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-01 14:05:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:06,597 INFO L225 Difference]: With dead ends: 20969 [2018-12-01 14:05:06,597 INFO L226 Difference]: Without dead ends: 20898 [2018-12-01 14:05:06,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:05:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-01 14:05:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-01 14:05:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-01 14:05:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-01 14:05:06,773 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-01 14:05:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:06,774 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-01 14:05:06,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-01 14:05:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 14:05:06,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:06,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:06,780 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 553940321, now seen corresponding path program 1 times [2018-12-01 14:05:06,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:06,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:05:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:06,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:06,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:06,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:06,837 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-01 14:05:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:07,022 INFO L93 Difference]: Finished difference Result 17635 states and 54585 transitions. [2018-12-01 14:05:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:05:07,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-01 14:05:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:07,042 INFO L225 Difference]: With dead ends: 17635 [2018-12-01 14:05:07,042 INFO L226 Difference]: Without dead ends: 17635 [2018-12-01 14:05:07,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-01 14:05:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 15793. [2018-12-01 14:05:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15793 states. [2018-12-01 14:05:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15793 states to 15793 states and 49131 transitions. [2018-12-01 14:05:07,228 INFO L78 Accepts]: Start accepts. Automaton has 15793 states and 49131 transitions. Word has length 64 [2018-12-01 14:05:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:07,229 INFO L480 AbstractCegarLoop]: Abstraction has 15793 states and 49131 transitions. [2018-12-01 14:05:07,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 15793 states and 49131 transitions. [2018-12-01 14:05:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 14:05:07,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:07,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:07,233 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:07,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1523269022, now seen corresponding path program 1 times [2018-12-01 14:05:07,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:07,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:07,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:07,273 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-01 14:05:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:05:07,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:05:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:05:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:05:07,274 INFO L87 Difference]: Start difference. First operand 15793 states and 49131 transitions. Second operand 3 states. [2018-12-01 14:05:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:07,419 INFO L93 Difference]: Finished difference Result 16385 states and 50738 transitions. [2018-12-01 14:05:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:05:07,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-01 14:05:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:07,441 INFO L225 Difference]: With dead ends: 16385 [2018-12-01 14:05:07,441 INFO L226 Difference]: Without dead ends: 16385 [2018-12-01 14:05:07,441 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-01 14:05:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16385 states. [2018-12-01 14:05:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16385 to 16109. [2018-12-01 14:05:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16109 states. [2018-12-01 14:05:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 49981 transitions. [2018-12-01 14:05:07,664 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 49981 transitions. Word has length 64 [2018-12-01 14:05:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:07,664 INFO L480 AbstractCegarLoop]: Abstraction has 16109 states and 49981 transitions. [2018-12-01 14:05:07,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:05:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 49981 transitions. [2018-12-01 14:05:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:07,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:07,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:07,670 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:07,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 493974152, now seen corresponding path program 1 times [2018-12-01 14:05:07,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:07,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:07,736 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-01 14:05:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:07,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:07,737 INFO L87 Difference]: Start difference. First operand 16109 states and 49981 transitions. Second operand 6 states. [2018-12-01 14:05:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:08,372 INFO L93 Difference]: Finished difference Result 19821 states and 60437 transitions. [2018-12-01 14:05:08,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:08,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-01 14:05:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:08,395 INFO L225 Difference]: With dead ends: 19821 [2018-12-01 14:05:08,395 INFO L226 Difference]: Without dead ends: 19821 [2018-12-01 14:05:08,395 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-01 14:05:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states. [2018-12-01 14:05:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 18617. [2018-12-01 14:05:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18617 states. [2018-12-01 14:05:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 57217 transitions. [2018-12-01 14:05:08,590 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 57217 transitions. Word has length 66 [2018-12-01 14:05:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:08,591 INFO L480 AbstractCegarLoop]: Abstraction has 18617 states and 57217 transitions. [2018-12-01 14:05:08,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 57217 transitions. [2018-12-01 14:05:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:08,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:08,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:08,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:08,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1583235191, now seen corresponding path program 1 times [2018-12-01 14:05:08,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:08,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:08,655 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-01 14:05:08,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:08,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:08,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:08,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:08,656 INFO L87 Difference]: Start difference. First operand 18617 states and 57217 transitions. Second operand 6 states. [2018-12-01 14:05:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:08,914 INFO L93 Difference]: Finished difference Result 21449 states and 63626 transitions. [2018-12-01 14:05:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:05:08,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-01 14:05:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:08,936 INFO L225 Difference]: With dead ends: 21449 [2018-12-01 14:05:08,936 INFO L226 Difference]: Without dead ends: 21449 [2018-12-01 14:05:08,936 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-01 14:05:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21449 states. [2018-12-01 14:05:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21449 to 19133. [2018-12-01 14:05:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19133 states. [2018-12-01 14:05:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19133 states to 19133 states and 57764 transitions. [2018-12-01 14:05:09,139 INFO L78 Accepts]: Start accepts. Automaton has 19133 states and 57764 transitions. Word has length 66 [2018-12-01 14:05:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:09,140 INFO L480 AbstractCegarLoop]: Abstraction has 19133 states and 57764 transitions. [2018-12-01 14:05:09,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19133 states and 57764 transitions. [2018-12-01 14:05:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:09,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:09,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:09,147 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:09,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1371884278, now seen corresponding path program 1 times [2018-12-01 14:05:09,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:09,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:09,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:09,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:09,230 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-01 14:05:09,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:09,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:09,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:09,231 INFO L87 Difference]: Start difference. First operand 19133 states and 57764 transitions. Second operand 5 states. [2018-12-01 14:05:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:09,468 INFO L93 Difference]: Finished difference Result 25024 states and 75018 transitions. [2018-12-01 14:05:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:09,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 14:05:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:09,497 INFO L225 Difference]: With dead ends: 25024 [2018-12-01 14:05:09,498 INFO L226 Difference]: Without dead ends: 25024 [2018-12-01 14:05:09,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2018-12-01 14:05:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 22709. [2018-12-01 14:05:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22709 states. [2018-12-01 14:05:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22709 states to 22709 states and 68032 transitions. [2018-12-01 14:05:09,745 INFO L78 Accepts]: Start accepts. Automaton has 22709 states and 68032 transitions. Word has length 66 [2018-12-01 14:05:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:09,746 INFO L480 AbstractCegarLoop]: Abstraction has 22709 states and 68032 transitions. [2018-12-01 14:05:09,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22709 states and 68032 transitions. [2018-12-01 14:05:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:09,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:09,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:09,754 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:09,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1882418455, now seen corresponding path program 1 times [2018-12-01 14:05:09,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:09,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:09,784 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-01 14:05:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:09,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:09,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:09,785 INFO L87 Difference]: Start difference. First operand 22709 states and 68032 transitions. Second operand 4 states. [2018-12-01 14:05:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:10,130 INFO L93 Difference]: Finished difference Result 31689 states and 95699 transitions. [2018-12-01 14:05:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:05:10,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-01 14:05:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:10,164 INFO L225 Difference]: With dead ends: 31689 [2018-12-01 14:05:10,165 INFO L226 Difference]: Without dead ends: 31537 [2018-12-01 14:05:10,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-12-01 14:05:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 28553. [2018-12-01 14:05:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28553 states. [2018-12-01 14:05:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28553 states to 28553 states and 86263 transitions. [2018-12-01 14:05:10,485 INFO L78 Accepts]: Start accepts. Automaton has 28553 states and 86263 transitions. Word has length 66 [2018-12-01 14:05:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:10,485 INFO L480 AbstractCegarLoop]: Abstraction has 28553 states and 86263 transitions. [2018-12-01 14:05:10,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28553 states and 86263 transitions. [2018-12-01 14:05:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:10,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:10,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:10,493 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:10,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -74963992, now seen corresponding path program 1 times [2018-12-01 14:05:10,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:10,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:10,541 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-01 14:05:10,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:10,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:10,542 INFO L87 Difference]: Start difference. First operand 28553 states and 86263 transitions. Second operand 5 states. [2018-12-01 14:05:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:10,887 INFO L93 Difference]: Finished difference Result 40195 states and 119844 transitions. [2018-12-01 14:05:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:05:10,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 14:05:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:10,933 INFO L225 Difference]: With dead ends: 40195 [2018-12-01 14:05:10,934 INFO L226 Difference]: Without dead ends: 39987 [2018-12-01 14:05:10,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:05:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39987 states. [2018-12-01 14:05:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39987 to 35807. [2018-12-01 14:05:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35807 states. [2018-12-01 14:05:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35807 states to 35807 states and 107399 transitions. [2018-12-01 14:05:11,378 INFO L78 Accepts]: Start accepts. Automaton has 35807 states and 107399 transitions. Word has length 66 [2018-12-01 14:05:11,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:11,378 INFO L480 AbstractCegarLoop]: Abstraction has 35807 states and 107399 transitions. [2018-12-01 14:05:11,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35807 states and 107399 transitions. [2018-12-01 14:05:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:11,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:11,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:11,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:11,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 615597482, now seen corresponding path program 1 times [2018-12-01 14:05:11,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:11,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:11,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:11,419 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-01 14:05:11,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:11,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:11,420 INFO L87 Difference]: Start difference. First operand 35807 states and 107399 transitions. Second operand 5 states. [2018-12-01 14:05:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:11,458 INFO L93 Difference]: Finished difference Result 9315 states and 22546 transitions. [2018-12-01 14:05:11,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:05:11,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-01 14:05:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:11,463 INFO L225 Difference]: With dead ends: 9315 [2018-12-01 14:05:11,463 INFO L226 Difference]: Without dead ends: 7463 [2018-12-01 14:05:11,464 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-01 14:05:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2018-12-01 14:05:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6360. [2018-12-01 14:05:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6360 states. [2018-12-01 14:05:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 15017 transitions. [2018-12-01 14:05:11,515 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 15017 transitions. Word has length 66 [2018-12-01 14:05:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:11,515 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 15017 transitions. [2018-12-01 14:05:11,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 15017 transitions. [2018-12-01 14:05:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 14:05:11,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:11,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:11,519 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:11,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:11,519 INFO L82 PathProgramCache]: Analyzing trace with hash 890203314, now seen corresponding path program 1 times [2018-12-01 14:05:11,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:11,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:11,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:11,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:11,539 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-01 14:05:11,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:11,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:05:11,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:05:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:05:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:05:11,540 INFO L87 Difference]: Start difference. First operand 6360 states and 15017 transitions. Second operand 3 states. [2018-12-01 14:05:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:11,565 INFO L93 Difference]: Finished difference Result 8819 states and 20756 transitions. [2018-12-01 14:05:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:05:11,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-01 14:05:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:11,571 INFO L225 Difference]: With dead ends: 8819 [2018-12-01 14:05:11,572 INFO L226 Difference]: Without dead ends: 8819 [2018-12-01 14:05:11,572 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-01 14:05:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8819 states. [2018-12-01 14:05:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8819 to 6299. [2018-12-01 14:05:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2018-12-01 14:05:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 14557 transitions. [2018-12-01 14:05:11,626 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 14557 transitions. Word has length 66 [2018-12-01 14:05:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:11,626 INFO L480 AbstractCegarLoop]: Abstraction has 6299 states and 14557 transitions. [2018-12-01 14:05:11,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:05:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 14557 transitions. [2018-12-01 14:05:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-01 14:05:11,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:11,631 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] [2018-12-01 14:05:11,632 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:11,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1181781029, now seen corresponding path program 1 times [2018-12-01 14:05:11,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:11,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:11,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:11,679 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-01 14:05:11,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:11,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:11,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:11,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:11,680 INFO L87 Difference]: Start difference. First operand 6299 states and 14557 transitions. Second operand 5 states. [2018-12-01 14:05:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:11,775 INFO L93 Difference]: Finished difference Result 7469 states and 17198 transitions. [2018-12-01 14:05:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:05:11,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-01 14:05:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:11,780 INFO L225 Difference]: With dead ends: 7469 [2018-12-01 14:05:11,780 INFO L226 Difference]: Without dead ends: 7469 [2018-12-01 14:05:11,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:05:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-01 14:05:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6743. [2018-12-01 14:05:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6743 states. [2018-12-01 14:05:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 15561 transitions. [2018-12-01 14:05:11,828 INFO L78 Accepts]: Start accepts. Automaton has 6743 states and 15561 transitions. Word has length 72 [2018-12-01 14:05:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:11,828 INFO L480 AbstractCegarLoop]: Abstraction has 6743 states and 15561 transitions. [2018-12-01 14:05:11,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6743 states and 15561 transitions. [2018-12-01 14:05:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-01 14:05:11,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:11,832 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] [2018-12-01 14:05:11,833 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:11,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1370375932, now seen corresponding path program 1 times [2018-12-01 14:05:11,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:11,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:11,930 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-01 14:05:11,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:11,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 14:05:11,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 14:05:11,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 14:05:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:05:11,930 INFO L87 Difference]: Start difference. First operand 6743 states and 15561 transitions. Second operand 9 states. [2018-12-01 14:05:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:12,203 INFO L93 Difference]: Finished difference Result 8945 states and 20482 transitions. [2018-12-01 14:05:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 14:05:12,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-01 14:05:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:12,208 INFO L225 Difference]: With dead ends: 8945 [2018-12-01 14:05:12,208 INFO L226 Difference]: Without dead ends: 8826 [2018-12-01 14:05:12,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-01 14:05:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2018-12-01 14:05:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 6840. [2018-12-01 14:05:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6840 states. [2018-12-01 14:05:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 15654 transitions. [2018-12-01 14:05:12,261 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 15654 transitions. Word has length 72 [2018-12-01 14:05:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:12,261 INFO L480 AbstractCegarLoop]: Abstraction has 6840 states and 15654 transitions. [2018-12-01 14:05:12,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 14:05:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 15654 transitions. [2018-12-01 14:05:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 14:05:12,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:12,265 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] [2018-12-01 14:05:12,266 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:12,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:12,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1666827177, now seen corresponding path program 1 times [2018-12-01 14:05:12,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:12,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:12,301 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-01 14:05:12,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:12,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:12,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:12,302 INFO L87 Difference]: Start difference. First operand 6840 states and 15654 transitions. Second operand 4 states. [2018-12-01 14:05:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:12,457 INFO L93 Difference]: Finished difference Result 10607 states and 24141 transitions. [2018-12-01 14:05:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:05:12,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 14:05:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:12,464 INFO L225 Difference]: With dead ends: 10607 [2018-12-01 14:05:12,464 INFO L226 Difference]: Without dead ends: 10607 [2018-12-01 14:05:12,464 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-01 14:05:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10607 states. [2018-12-01 14:05:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10607 to 7960. [2018-12-01 14:05:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2018-12-01 14:05:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 17988 transitions. [2018-12-01 14:05:12,528 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 17988 transitions. Word has length 91 [2018-12-01 14:05:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:12,529 INFO L480 AbstractCegarLoop]: Abstraction has 7960 states and 17988 transitions. [2018-12-01 14:05:12,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 17988 transitions. [2018-12-01 14:05:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 14:05:12,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:12,534 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] [2018-12-01 14:05:12,534 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:12,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash 496143053, now seen corresponding path program 1 times [2018-12-01 14:05:12,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:12,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:12,562 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-01 14:05:12,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:12,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:05:12,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:05:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:05:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:05:12,563 INFO L87 Difference]: Start difference. First operand 7960 states and 17988 transitions. Second operand 4 states. [2018-12-01 14:05:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:12,615 INFO L93 Difference]: Finished difference Result 8525 states and 19281 transitions. [2018-12-01 14:05:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:05:12,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 14:05:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:12,621 INFO L225 Difference]: With dead ends: 8525 [2018-12-01 14:05:12,621 INFO L226 Difference]: Without dead ends: 8525 [2018-12-01 14:05:12,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2018-12-01 14:05:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 7866. [2018-12-01 14:05:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7866 states. [2018-12-01 14:05:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7866 states to 7866 states and 17883 transitions. [2018-12-01 14:05:12,677 INFO L78 Accepts]: Start accepts. Automaton has 7866 states and 17883 transitions. Word has length 91 [2018-12-01 14:05:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:12,677 INFO L480 AbstractCegarLoop]: Abstraction has 7866 states and 17883 transitions. [2018-12-01 14:05:12,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:05:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7866 states and 17883 transitions. [2018-12-01 14:05:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:12,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:12,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, 1, 1, 1, 1, 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-01 14:05:12,682 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:12,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash -471503779, now seen corresponding path program 1 times [2018-12-01 14:05:12,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:12,740 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-01 14:05:12,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:12,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:05:12,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:05:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:05:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:12,741 INFO L87 Difference]: Start difference. First operand 7866 states and 17883 transitions. Second operand 7 states. [2018-12-01 14:05:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:13,188 INFO L93 Difference]: Finished difference Result 9704 states and 21991 transitions. [2018-12-01 14:05:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:13,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 14:05:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:13,194 INFO L225 Difference]: With dead ends: 9704 [2018-12-01 14:05:13,194 INFO L226 Difference]: Without dead ends: 9704 [2018-12-01 14:05:13,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-01 14:05:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7978. [2018-12-01 14:05:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7978 states. [2018-12-01 14:05:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7978 states to 7978 states and 18203 transitions. [2018-12-01 14:05:13,255 INFO L78 Accepts]: Start accepts. Automaton has 7978 states and 18203 transitions. Word has length 93 [2018-12-01 14:05:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:13,255 INFO L480 AbstractCegarLoop]: Abstraction has 7978 states and 18203 transitions. [2018-12-01 14:05:13,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:05:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 7978 states and 18203 transitions. [2018-12-01 14:05:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:13,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:13,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:13,261 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:13,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2034999584, now seen corresponding path program 1 times [2018-12-01 14:05:13,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:13,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:13,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:13,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:13,299 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-01 14:05:13,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:13,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:13,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:13,299 INFO L87 Difference]: Start difference. First operand 7978 states and 18203 transitions. Second operand 5 states. [2018-12-01 14:05:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:13,365 INFO L93 Difference]: Finished difference Result 8885 states and 20161 transitions. [2018-12-01 14:05:13,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:13,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 14:05:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:13,371 INFO L225 Difference]: With dead ends: 8885 [2018-12-01 14:05:13,371 INFO L226 Difference]: Without dead ends: 8885 [2018-12-01 14:05:13,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2018-12-01 14:05:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6874. [2018-12-01 14:05:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2018-12-01 14:05:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 15722 transitions. [2018-12-01 14:05:13,426 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 15722 transitions. Word has length 93 [2018-12-01 14:05:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:13,426 INFO L480 AbstractCegarLoop]: Abstraction has 6874 states and 15722 transitions. [2018-12-01 14:05:13,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 15722 transitions. [2018-12-01 14:05:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:13,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:13,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:13,431 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:13,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2005231167, now seen corresponding path program 1 times [2018-12-01 14:05:13,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:13,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:13,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:13,472 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-01 14:05:13,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:13,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:13,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:13,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:13,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:13,473 INFO L87 Difference]: Start difference. First operand 6874 states and 15722 transitions. Second operand 5 states. [2018-12-01 14:05:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:13,762 INFO L93 Difference]: Finished difference Result 11408 states and 26291 transitions. [2018-12-01 14:05:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:05:13,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 14:05:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:13,771 INFO L225 Difference]: With dead ends: 11408 [2018-12-01 14:05:13,771 INFO L226 Difference]: Without dead ends: 11330 [2018-12-01 14:05:13,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:05:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11330 states. [2018-12-01 14:05:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11330 to 8015. [2018-12-01 14:05:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8015 states. [2018-12-01 14:05:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 18369 transitions. [2018-12-01 14:05:13,843 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 18369 transitions. Word has length 93 [2018-12-01 14:05:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:13,843 INFO L480 AbstractCegarLoop]: Abstraction has 8015 states and 18369 transitions. [2018-12-01 14:05:13,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 18369 transitions. [2018-12-01 14:05:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:13,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:13,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:13,849 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:13,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1044971648, now seen corresponding path program 1 times [2018-12-01 14:05:13,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:13,896 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-01 14:05:13,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:13,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:13,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:13,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:13,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:13,897 INFO L87 Difference]: Start difference. First operand 8015 states and 18369 transitions. Second operand 6 states. [2018-12-01 14:05:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:14,071 INFO L93 Difference]: Finished difference Result 10150 states and 23091 transitions. [2018-12-01 14:05:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 14:05:14,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 14:05:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:14,077 INFO L225 Difference]: With dead ends: 10150 [2018-12-01 14:05:14,078 INFO L226 Difference]: Without dead ends: 10071 [2018-12-01 14:05:14,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:05:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10071 states. [2018-12-01 14:05:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10071 to 7614. [2018-12-01 14:05:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-01 14:05:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17479 transitions. [2018-12-01 14:05:14,142 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17479 transitions. Word has length 93 [2018-12-01 14:05:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:14,142 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17479 transitions. [2018-12-01 14:05:14,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17479 transitions. [2018-12-01 14:05:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:14,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:14,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:14,148 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:14,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1661415981, now seen corresponding path program 1 times [2018-12-01 14:05:14,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:14,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:14,231 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-01 14:05:14,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:14,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 14:05:14,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 14:05:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 14:05:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:05:14,232 INFO L87 Difference]: Start difference. First operand 7614 states and 17479 transitions. Second operand 9 states. [2018-12-01 14:05:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:14,548 INFO L93 Difference]: Finished difference Result 10662 states and 24405 transitions. [2018-12-01 14:05:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-01 14:05:14,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-01 14:05:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:14,555 INFO L225 Difference]: With dead ends: 10662 [2018-12-01 14:05:14,555 INFO L226 Difference]: Without dead ends: 10630 [2018-12-01 14:05:14,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-01 14:05:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2018-12-01 14:05:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9163. [2018-12-01 14:05:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2018-12-01 14:05:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 20929 transitions. [2018-12-01 14:05:14,625 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 20929 transitions. Word has length 93 [2018-12-01 14:05:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:14,625 INFO L480 AbstractCegarLoop]: Abstraction has 9163 states and 20929 transitions. [2018-12-01 14:05:14,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 14:05:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 20929 transitions. [2018-12-01 14:05:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:14,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:14,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:14,633 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:14,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 836599956, now seen corresponding path program 1 times [2018-12-01 14:05:14,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:14,702 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-01 14:05:14,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:14,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 14:05:14,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:05:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:05:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:05:14,703 INFO L87 Difference]: Start difference. First operand 9163 states and 20929 transitions. Second operand 8 states. [2018-12-01 14:05:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:14,932 INFO L93 Difference]: Finished difference Result 14219 states and 32893 transitions. [2018-12-01 14:05:14,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 14:05:14,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-01 14:05:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:14,942 INFO L225 Difference]: With dead ends: 14219 [2018-12-01 14:05:14,942 INFO L226 Difference]: Without dead ends: 14219 [2018-12-01 14:05:14,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 14:05:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14219 states. [2018-12-01 14:05:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14219 to 9753. [2018-12-01 14:05:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9753 states. [2018-12-01 14:05:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9753 states to 9753 states and 22460 transitions. [2018-12-01 14:05:15,030 INFO L78 Accepts]: Start accepts. Automaton has 9753 states and 22460 transitions. Word has length 93 [2018-12-01 14:05:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:15,030 INFO L480 AbstractCegarLoop]: Abstraction has 9753 states and 22460 transitions. [2018-12-01 14:05:15,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:05:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9753 states and 22460 transitions. [2018-12-01 14:05:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:15,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:15,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:15,036 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:15,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1724103637, now seen corresponding path program 1 times [2018-12-01 14:05:15,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:15,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:15,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:15,108 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-01 14:05:15,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:15,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 14:05:15,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:05:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:05:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:05:15,109 INFO L87 Difference]: Start difference. First operand 9753 states and 22460 transitions. Second operand 7 states. [2018-12-01 14:05:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:15,202 INFO L93 Difference]: Finished difference Result 13588 states and 31510 transitions. [2018-12-01 14:05:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:15,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 14:05:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:15,212 INFO L225 Difference]: With dead ends: 13588 [2018-12-01 14:05:15,212 INFO L226 Difference]: Without dead ends: 13588 [2018-12-01 14:05:15,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:05:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2018-12-01 14:05:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 9833. [2018-12-01 14:05:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9833 states. [2018-12-01 14:05:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9833 states to 9833 states and 22391 transitions. [2018-12-01 14:05:15,295 INFO L78 Accepts]: Start accepts. Automaton has 9833 states and 22391 transitions. Word has length 93 [2018-12-01 14:05:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:15,295 INFO L480 AbstractCegarLoop]: Abstraction has 9833 states and 22391 transitions. [2018-12-01 14:05:15,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:05:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 9833 states and 22391 transitions. [2018-12-01 14:05:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 14:05:15,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:15,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:15,301 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:15,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash -7871915, now seen corresponding path program 1 times [2018-12-01 14:05:15,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:15,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:15,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:15,352 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-01 14:05:15,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:15,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:15,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:15,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:15,353 INFO L87 Difference]: Start difference. First operand 9833 states and 22391 transitions. Second operand 6 states. [2018-12-01 14:05:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:15,420 INFO L93 Difference]: Finished difference Result 9353 states and 20935 transitions. [2018-12-01 14:05:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:15,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 14:05:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:15,426 INFO L225 Difference]: With dead ends: 9353 [2018-12-01 14:05:15,426 INFO L226 Difference]: Without dead ends: 9353 [2018-12-01 14:05:15,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:05:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2018-12-01 14:05:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5822. [2018-12-01 14:05:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-12-01 14:05:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13049 transitions. [2018-12-01 14:05:15,487 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13049 transitions. Word has length 93 [2018-12-01 14:05:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:15,487 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13049 transitions. [2018-12-01 14:05:15,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13049 transitions. [2018-12-01 14:05:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 14:05:15,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:15,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:15,491 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:15,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1803035193, now seen corresponding path program 1 times [2018-12-01 14:05:15,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:15,547 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-01 14:05:15,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:15,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:05:15,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:05:15,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:05:15,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:05:15,548 INFO L87 Difference]: Start difference. First operand 5822 states and 13049 transitions. Second operand 5 states. [2018-12-01 14:05:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:15,573 INFO L93 Difference]: Finished difference Result 5822 states and 13033 transitions. [2018-12-01 14:05:15,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:05:15,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-01 14:05:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:15,577 INFO L225 Difference]: With dead ends: 5822 [2018-12-01 14:05:15,577 INFO L226 Difference]: Without dead ends: 5822 [2018-12-01 14:05:15,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5822 states. [2018-12-01 14:05:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5822 to 5822. [2018-12-01 14:05:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5822 states. [2018-12-01 14:05:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5822 states to 5822 states and 13033 transitions. [2018-12-01 14:05:15,613 INFO L78 Accepts]: Start accepts. Automaton has 5822 states and 13033 transitions. Word has length 95 [2018-12-01 14:05:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:15,613 INFO L480 AbstractCegarLoop]: Abstraction has 5822 states and 13033 transitions. [2018-12-01 14:05:15,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:05:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5822 states and 13033 transitions. [2018-12-01 14:05:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 14:05:15,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:15,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:15,617 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:15,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -915531512, now seen corresponding path program 1 times [2018-12-01 14:05:15,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:15,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:15,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:15,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:15,732 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-01 14:05:15,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:15,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-01 14:05:15,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 14:05:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 14:05:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:05:15,733 INFO L87 Difference]: Start difference. First operand 5822 states and 13033 transitions. Second operand 11 states. [2018-12-01 14:05:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:16,956 INFO L93 Difference]: Finished difference Result 10998 states and 24764 transitions. [2018-12-01 14:05:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 14:05:16,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-01 14:05:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:16,965 INFO L225 Difference]: With dead ends: 10998 [2018-12-01 14:05:16,965 INFO L226 Difference]: Without dead ends: 7682 [2018-12-01 14:05:16,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-01 14:05:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2018-12-01 14:05:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 5708. [2018-12-01 14:05:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5708 states. [2018-12-01 14:05:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5708 states to 5708 states and 12720 transitions. [2018-12-01 14:05:17,016 INFO L78 Accepts]: Start accepts. Automaton has 5708 states and 12720 transitions. Word has length 95 [2018-12-01 14:05:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:17,016 INFO L480 AbstractCegarLoop]: Abstraction has 5708 states and 12720 transitions. [2018-12-01 14:05:17,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 14:05:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 5708 states and 12720 transitions. [2018-12-01 14:05:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 14:05:17,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:17,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:17,020 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:17,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2034339057, now seen corresponding path program 1 times [2018-12-01 14:05:17,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:17,110 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-01 14:05:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:17,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:17,111 INFO L87 Difference]: Start difference. First operand 5708 states and 12720 transitions. Second operand 6 states. [2018-12-01 14:05:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:17,197 INFO L93 Difference]: Finished difference Result 6462 states and 14232 transitions. [2018-12-01 14:05:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:05:17,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-01 14:05:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:17,202 INFO L225 Difference]: With dead ends: 6462 [2018-12-01 14:05:17,202 INFO L226 Difference]: Without dead ends: 6432 [2018-12-01 14:05:17,202 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-01 14:05:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2018-12-01 14:05:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 5653. [2018-12-01 14:05:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2018-12-01 14:05:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 12502 transitions. [2018-12-01 14:05:17,243 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 12502 transitions. Word has length 95 [2018-12-01 14:05:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:17,244 INFO L480 AbstractCegarLoop]: Abstraction has 5653 states and 12502 transitions. [2018-12-01 14:05:17,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 12502 transitions. [2018-12-01 14:05:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 14:05:17,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 14:05:17,248 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:17,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1697868305, now seen corresponding path program 2 times [2018-12-01 14:05:17,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:17,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:17,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:05:17,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:05:17,289 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-01 14:05:17,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:05:17,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:05:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:05:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:05:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:05:17,290 INFO L87 Difference]: Start difference. First operand 5653 states and 12502 transitions. Second operand 6 states. [2018-12-01 14:05:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:05:17,397 INFO L93 Difference]: Finished difference Result 6090 states and 13395 transitions. [2018-12-01 14:05:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:05:17,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-01 14:05:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:05:17,401 INFO L225 Difference]: With dead ends: 6090 [2018-12-01 14:05:17,401 INFO L226 Difference]: Without dead ends: 6090 [2018-12-01 14:05:17,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:05:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2018-12-01 14:05:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 5579. [2018-12-01 14:05:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5579 states. [2018-12-01 14:05:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 12324 transitions. [2018-12-01 14:05:17,439 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 12324 transitions. Word has length 95 [2018-12-01 14:05:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:05:17,439 INFO L480 AbstractCegarLoop]: Abstraction has 5579 states and 12324 transitions. [2018-12-01 14:05:17,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:05:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 12324 transitions. [2018-12-01 14:05:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-01 14:05:17,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:05:17,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:05:17,443 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:05:17,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:05:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1930862478, now seen corresponding path program 2 times [2018-12-01 14:05:17,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:05:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:05:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:05:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:05:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:05:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:05:17,477 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 14:05:17,539 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 14:05:17,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:05:17 BasicIcfg [2018-12-01 14:05:17,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 14:05:17,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:05:17,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:05:17,540 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:05:17,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:05:01" (3/4) ... [2018-12-01 14:05:17,542 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 14:05:17,607 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6394025f-742a-4d44-9b65-16c481429268/bin-2019/uautomizer/witness.graphml [2018-12-01 14:05:17,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:05:17,608 INFO L168 Benchmark]: Toolchain (without parser) took 17085.00 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 950.6 MB in the beginning and 1.8 GB in the end (delta: -866.2 MB). Peak memory consumption was 627.5 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,609 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-01 14:05:17,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,610 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:05:17,610 INFO L168 Benchmark]: RCFGBuilder took 357.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,610 INFO L168 Benchmark]: TraceAbstraction took 16271.53 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -819.4 MB). Peak memory consumption was 569.9 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,610 INFO L168 Benchmark]: Witness Printer took 67.64 ms. Allocated memory is still 2.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-01 14:05:17,611 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 333.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16271.53 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -819.4 MB). Peak memory consumption was 569.9 MB. Max. memory is 11.5 GB. * Witness Printer took 67.64 ms. Allocated memory is still 2.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] -1 pthread_t t2311; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] FCALL, FORK -1 pthread_create(&t2311, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L701] 0 y$w_buff1 = y$w_buff0 [L702] 0 y$w_buff0 = 1 [L703] 0 y$w_buff1_used = y$w_buff0_used [L704] 0 y$w_buff0_used = (_Bool)1 [L772] -1 pthread_t t2312; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] FCALL, FORK -1 pthread_create(&t2312, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L707] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L708] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L709] 0 y$r_buff0_thd1 = (_Bool)1 [L712] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 __unbuffered_p1_EAX = x [L732] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] 1 y = y$flush_delayed ? y$mem_tmp : y [L745] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 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 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -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) [L780] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L781] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -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 [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L783] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -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 [L786] -1 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 16.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8464 SDtfs, 9143 SDslu, 19186 SDs, 0 SdLazy, 8306 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 84 SyntacticMatches, 31 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35807occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 85139 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2479 NumberOfCodeBlocks, 2479 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2352 ConstructedInterpolants, 0 QuantifiedInterpolants, 523561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...