./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.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_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/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 874a9972fda7c5371d5beee908ce94ffa39446d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 06:08:33,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:08:33,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:08:33,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:08:33,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:08:33,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:08:33,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:08:33,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:08:33,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:08:33,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:08:33,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:08:33,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:08:33,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:08:33,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:08:33,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:08:33,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:08:33,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:08:33,454 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:08:33,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:08:33,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:08:33,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:08:33,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:08:33,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:08:33,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:08:33,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:08:33,459 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:08:33,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:08:33,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:08:33,460 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:08:33,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:08:33,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:08:33,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:08:33,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:08:33,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:08:33,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:08:33,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:08:33,462 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 06:08:33,469 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:08:33,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:08:33,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:08:33,470 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:08:33,470 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:08:33,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 06:08:33,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 06:08:33,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:08:33,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:08:33,472 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 06:08:33,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:08:33,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:08:33,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 06:08:33,473 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_3d72b395-7b34-4b7f-9293-6e74272c0692/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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2018-12-02 06:08:33,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:08:33,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:08:33,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:08:33,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:08:33,502 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:08:33,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-02 06:08:33,536 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/data/8587903ad/82a69d39e1b141d78f1ff3da6c3f496f/FLAG583ca7ccd [2018-12-02 06:08:34,016 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:08:34,017 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-02 06:08:34,024 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/data/8587903ad/82a69d39e1b141d78f1ff3da6c3f496f/FLAG583ca7ccd [2018-12-02 06:08:34,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/data/8587903ad/82a69d39e1b141d78f1ff3da6c3f496f [2018-12-02 06:08:34,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:08:34,524 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:08:34,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:08:34,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:08:34,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:08:34,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cabf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34, skipping insertion in model container [2018-12-02 06:08:34,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:08:34,554 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:08:34,730 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:08:34,737 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:08:34,811 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:08:34,840 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:08:34,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34 WrapperNode [2018-12-02 06:08:34,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:08:34,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:08:34,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:08:34,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:08:34,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:08:34,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:08:34,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:08:34,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:08:34,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... [2018-12-02 06:08:34,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:08:34,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:08:34,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:08:34,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:08:34,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/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-02 06:08:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:08:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:08:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 06:08:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:08:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 06:08:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 06:08:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 06:08:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 06:08:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 06:08:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:08:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:08:34,928 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 06:08:35,232 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:08:35,232 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 06:08:35,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:08:35 BoogieIcfgContainer [2018-12-02 06:08:35,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:08:35,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:08:35,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:08:35,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:08:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:08:34" (1/3) ... [2018-12-02 06:08:35,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1439d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:08:35, skipping insertion in model container [2018-12-02 06:08:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:08:34" (2/3) ... [2018-12-02 06:08:35,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1439d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:08:35, skipping insertion in model container [2018-12-02 06:08:35,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:08:35" (3/3) ... [2018-12-02 06:08:35,236 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2018-12-02 06:08:35,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,265 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,275 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,276 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,277 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,278 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,279 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 06:08:35,283 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 06:08:35,283 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:08:35,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 06:08:35,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 06:08:35,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:08:35,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:08:35,316 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 06:08:35,316 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:08:35,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:08:35,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:08:35,316 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:08:35,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:08:35,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:08:35,325 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 06:08:36,981 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 06:08:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 06:08:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 06:08:36,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:36,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:36,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:36,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-02 06:08:36,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:37,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:37,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:37,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:37,152 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 06:08:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:37,602 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 06:08:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:08:37,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 06:08:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:37,748 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 06:08:37,748 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 06:08:37,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 06:08:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 06:08:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 06:08:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 06:08:38,562 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 06:08:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:38,562 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 06:08:38,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 06:08:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:08:38,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:38,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:38,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:38,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-02 06:08:38,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:38,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:38,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:38,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:38,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:38,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:38,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:38,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:38,634 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-02 06:08:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:39,143 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-02 06:08:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:08:39,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 06:08:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:39,381 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 06:08:39,381 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 06:08:39,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:08:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 06:08:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 06:08:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 06:08:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-02 06:08:40,132 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-02 06:08:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:40,133 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-02 06:08:40,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-02 06:08:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:08:40,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:40,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:40,137 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:40,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-02 06:08:40,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:40,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:40,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:40,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:40,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:40,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:40,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:40,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:40,185 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-02 06:08:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:40,701 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-02 06:08:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:08:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 06:08:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:40,853 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 06:08:40,853 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 06:08:40,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:08:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 06:08:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 06:08:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 06:08:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-02 06:08:41,829 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-02 06:08:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:41,829 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-02 06:08:41,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-02 06:08:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 06:08:41,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:41,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:41,834 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:41,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-02 06:08:41,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:41,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:41,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:41,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:41,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:41,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:08:41,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:08:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:08:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:41,857 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-02 06:08:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:42,087 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-02 06:08:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:08:42,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 06:08:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:42,199 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 06:08:42,200 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 06:08:42,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 06:08:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 06:08:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 06:08:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-02 06:08:43,217 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-02 06:08:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:43,218 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-02 06:08:43,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:08:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-02 06:08:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:08:43,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:43,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:43,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:43,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-02 06:08:43,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:43,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:43,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:43,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:43,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-02 06:08:43,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:43,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:43,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:43,300 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-02 06:08:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:43,805 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-02 06:08:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:08:43,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:08:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:43,922 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 06:08:43,922 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 06:08:43,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:08:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 06:08:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 06:08:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 06:08:45,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-02 06:08:45,011 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-02 06:08:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:45,011 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-02 06:08:45,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-02 06:08:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:08:45,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:45,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] [2018-12-02 06:08:45,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:45,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-02 06:08:45,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:45,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:45,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:45,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:45,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:08:45,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:08:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:08:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:45,081 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-02 06:08:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:45,809 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-02 06:08:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:08:45,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 06:08:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:45,956 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 06:08:45,956 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 06:08:45,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:08:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 06:08:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 06:08:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 06:08:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-02 06:08:47,381 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-02 06:08:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:47,382 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-02 06:08:47,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:08:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-02 06:08:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:08:47,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:47,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:47,391 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:47,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-02 06:08:47,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:47,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:47,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:47,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:47,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:47,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:08:47,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:08:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:08:47,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:47,422 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-02 06:08:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:47,609 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-02 06:08:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:08:47,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 06:08:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:47,709 INFO L225 Difference]: With dead ends: 57182 [2018-12-02 06:08:47,709 INFO L226 Difference]: Without dead ends: 57182 [2018-12-02 06:08:47,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-02 06:08:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-02 06:08:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-02 06:08:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-02 06:08:48,540 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-02 06:08:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:48,540 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-02 06:08:48,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:08:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-02 06:08:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 06:08:48,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:48,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:48,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:48,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-02 06:08:48,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:48,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:48,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:48,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:48,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:48,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:48,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:48,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:48,610 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-02 06:08:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:49,120 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-02 06:08:49,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:08:49,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 06:08:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:49,291 INFO L225 Difference]: With dead ends: 97908 [2018-12-02 06:08:49,291 INFO L226 Difference]: Without dead ends: 97332 [2018-12-02 06:08:49,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:08:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-02 06:08:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-02 06:08:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-02 06:08:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-02 06:08:50,491 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-02 06:08:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-02 06:08:50,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-02 06:08:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:08:50,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:50,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:50,499 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:50,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-02 06:08:50,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:50,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:50,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:50,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:50,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:50,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:50,571 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-02 06:08:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:50,854 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-02 06:08:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:08:50,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 06:08:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:50,948 INFO L225 Difference]: With dead ends: 56810 [2018-12-02 06:08:50,949 INFO L226 Difference]: Without dead ends: 56810 [2018-12-02 06:08:50,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-02 06:08:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-02 06:08:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-02 06:08:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-02 06:08:51,772 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-02 06:08:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:51,772 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-02 06:08:51,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-02 06:08:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:08:51,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:51,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] [2018-12-02 06:08:51,780 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-02 06:08:51,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:51,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:51,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:51,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:51,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:51,806 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-02 06:08:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:51,852 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-02 06:08:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:08:51,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 06:08:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:51,864 INFO L225 Difference]: With dead ends: 12705 [2018-12-02 06:08:51,864 INFO L226 Difference]: Without dead ends: 10887 [2018-12-02 06:08:51,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-02 06:08:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-02 06:08:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-02 06:08:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-02 06:08:51,968 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-02 06:08:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:51,968 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-02 06:08:51,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-02 06:08:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 06:08:51,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:51,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:51,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:51,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-02 06:08:51,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:51,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:51,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:51,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:51,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:51,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:51,995 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-02 06:08:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:52,073 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-02 06:08:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:08:52,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 06:08:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:52,086 INFO L225 Difference]: With dead ends: 12386 [2018-12-02 06:08:52,086 INFO L226 Difference]: Without dead ends: 12386 [2018-12-02 06:08:52,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-02 06:08:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-02 06:08:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-02 06:08:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-02 06:08:52,203 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-02 06:08:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:52,203 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-02 06:08:52,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-02 06:08:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 06:08:52,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:52,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:52,205 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:52,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:52,206 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-02 06:08:52,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:52,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:52,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:52,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:52,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:52,248 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-02 06:08:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:52,485 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-02 06:08:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:08:52,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 06:08:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:52,507 INFO L225 Difference]: With dead ends: 20935 [2018-12-02 06:08:52,507 INFO L226 Difference]: Without dead ends: 20864 [2018-12-02 06:08:52,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 06:08:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-02 06:08:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-02 06:08:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-02 06:08:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-02 06:08:52,680 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-02 06:08:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:52,680 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-02 06:08:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-02 06:08:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:52,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:52,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:52,685 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:52,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-02 06:08:52,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:52,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:52,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:52,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:08:52,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:08:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:08:52,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:52,705 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-02 06:08:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:52,829 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-02 06:08:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:08:52,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 06:08:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:52,844 INFO L225 Difference]: With dead ends: 13930 [2018-12-02 06:08:52,844 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 06:08:52,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 06:08:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-02 06:08:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-02 06:08:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-02 06:08:52,971 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-02 06:08:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:52,971 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-02 06:08:52,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:08:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-02 06:08:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:52,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:52,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:52,976 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:52,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-02 06:08:52,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:52,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:53,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:53,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:53,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:53,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:53,048 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-02 06:08:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:53,207 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-02 06:08:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:08:53,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 06:08:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:53,226 INFO L225 Difference]: With dead ends: 17463 [2018-12-02 06:08:53,226 INFO L226 Difference]: Without dead ends: 17463 [2018-12-02 06:08:53,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-02 06:08:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-02 06:08:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-02 06:08:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-02 06:08:53,382 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-02 06:08:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:53,382 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-02 06:08:53,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-02 06:08:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:53,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:53,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, 1] [2018-12-02 06:08:53,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:53,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:53,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-02 06:08:53,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:53,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:53,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:53,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:53,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:53,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:53,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:53,438 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-02 06:08:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:53,958 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-02 06:08:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:08:53,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 06:08:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:53,977 INFO L225 Difference]: With dead ends: 18862 [2018-12-02 06:08:53,977 INFO L226 Difference]: Without dead ends: 18862 [2018-12-02 06:08:53,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-02 06:08:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-02 06:08:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-02 06:08:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-02 06:08:54,158 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-02 06:08:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:54,158 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-02 06:08:54,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-02 06:08:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:54,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:54,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:54,164 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:54,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-02 06:08:54,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:54,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:54,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:54,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:54,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:54,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:54,220 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-02 06:08:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:54,464 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-02 06:08:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:08:54,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 06:08:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:54,484 INFO L225 Difference]: With dead ends: 20389 [2018-12-02 06:08:54,485 INFO L226 Difference]: Without dead ends: 20389 [2018-12-02 06:08:54,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:08:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-02 06:08:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-02 06:08:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-02 06:08:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-02 06:08:54,670 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-02 06:08:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:54,671 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-02 06:08:54,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-02 06:08:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:54,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:54,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:54,677 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:54,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-02 06:08:54,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:54,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:54,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:54,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:54,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:54,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:54,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:54,723 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-02 06:08:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:54,928 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-02 06:08:54,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:08:54,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:08:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:54,951 INFO L225 Difference]: With dead ends: 23413 [2018-12-02 06:08:54,951 INFO L226 Difference]: Without dead ends: 23413 [2018-12-02 06:08:54,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-02 06:08:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-02 06:08:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-02 06:08:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-02 06:08:55,177 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-02 06:08:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:55,177 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-02 06:08:55,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-02 06:08:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:55,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:55,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:55,184 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:55,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-02 06:08:55,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:55,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:55,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:55,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:55,223 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-02 06:08:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:55,527 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-02 06:08:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:08:55,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 06:08:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:55,556 INFO L225 Difference]: With dead ends: 26638 [2018-12-02 06:08:55,556 INFO L226 Difference]: Without dead ends: 26342 [2018-12-02 06:08:55,556 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-02 06:08:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-02 06:08:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-02 06:08:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-02 06:08:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-02 06:08:55,831 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-02 06:08:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:55,831 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-02 06:08:55,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-02 06:08:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:55,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:55,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:55,839 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:55,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-02 06:08:55,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:55,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:55,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-02 06:08:55,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:55,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:55,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:55,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:55,869 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 5 states. [2018-12-02 06:08:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:55,898 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-02 06:08:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:08:55,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 06:08:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:55,903 INFO L225 Difference]: With dead ends: 7314 [2018-12-02 06:08:55,903 INFO L226 Difference]: Without dead ends: 6004 [2018-12-02 06:08:55,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-02 06:08:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-02 06:08:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-02 06:08:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-02 06:08:55,942 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-02 06:08:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:55,942 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-02 06:08:55,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-02 06:08:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 06:08:55,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:55,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:55,945 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:55,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-02 06:08:55,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:55,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:08:55,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:08:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:08:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:55,969 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-02 06:08:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:55,999 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-02 06:08:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:08:56,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 06:08:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:56,004 INFO L225 Difference]: With dead ends: 7126 [2018-12-02 06:08:56,004 INFO L226 Difference]: Without dead ends: 7126 [2018-12-02 06:08:56,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:08:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-02 06:08:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-02 06:08:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-02 06:08:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-02 06:08:56,048 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-02 06:08:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-02 06:08:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:08:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-02 06:08:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:08:56,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:56,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:56,051 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:56,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-02 06:08:56,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:56,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:56,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:56,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:56,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:56,082 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-02 06:08:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:56,176 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-02 06:08:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:08:56,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 06:08:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:56,181 INFO L225 Difference]: With dead ends: 6617 [2018-12-02 06:08:56,181 INFO L226 Difference]: Without dead ends: 6617 [2018-12-02 06:08:56,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:08:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-02 06:08:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-02 06:08:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-02 06:08:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-02 06:08:56,222 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-02 06:08:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:56,222 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-02 06:08:56,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-02 06:08:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 06:08:56,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:56,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:56,227 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:56,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-02 06:08:56,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:56,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:56,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:56,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:08:56,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:08:56,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:08:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:56,269 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-02 06:08:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:56,509 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-02 06:08:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 06:08:56,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 06:08:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:56,517 INFO L225 Difference]: With dead ends: 7099 [2018-12-02 06:08:56,517 INFO L226 Difference]: Without dead ends: 6980 [2018-12-02 06:08:56,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 06:08:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-02 06:08:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-02 06:08:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-02 06:08:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-02 06:08:56,583 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-02 06:08:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:56,583 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-02 06:08:56,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:08:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-02 06:08:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:08:56,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:56,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:56,589 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:56,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1089513130, now seen corresponding path program 1 times [2018-12-02 06:08:56,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:56,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:56,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:56,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:08:56,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:08:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:08:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:56,674 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 7 states. [2018-12-02 06:08:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:56,997 INFO L93 Difference]: Finished difference Result 7555 states and 17025 transitions. [2018-12-02 06:08:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:08:56,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 06:08:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:57,002 INFO L225 Difference]: With dead ends: 7555 [2018-12-02 06:08:57,002 INFO L226 Difference]: Without dead ends: 7555 [2018-12-02 06:08:57,002 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-02 06:08:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2018-12-02 06:08:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 6132. [2018-12-02 06:08:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2018-12-02 06:08:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 13868 transitions. [2018-12-02 06:08:57,050 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 13868 transitions. Word has length 94 [2018-12-02 06:08:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:57,050 INFO L480 AbstractCegarLoop]: Abstraction has 6132 states and 13868 transitions. [2018-12-02 06:08:57,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:08:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 13868 transitions. [2018-12-02 06:08:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 06:08:57,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:57,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:57,054 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:57,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 255270735, now seen corresponding path program 1 times [2018-12-02 06:08:57,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:57,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:57,082 INFO L87 Difference]: Start difference. First operand 6132 states and 13868 transitions. Second operand 4 states. [2018-12-02 06:08:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:57,153 INFO L93 Difference]: Finished difference Result 7310 states and 16381 transitions. [2018-12-02 06:08:57,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:08:57,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 06:08:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:57,158 INFO L225 Difference]: With dead ends: 7310 [2018-12-02 06:08:57,158 INFO L226 Difference]: Without dead ends: 7310 [2018-12-02 06:08:57,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7310 states. [2018-12-02 06:08:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7310 to 6502. [2018-12-02 06:08:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6502 states. [2018-12-02 06:08:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 14667 transitions. [2018-12-02 06:08:57,228 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 14667 transitions. Word has length 94 [2018-12-02 06:08:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:57,228 INFO L480 AbstractCegarLoop]: Abstraction has 6502 states and 14667 transitions. [2018-12-02 06:08:57,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 14667 transitions. [2018-12-02 06:08:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:57,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:57,233 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:57,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 744007125, now seen corresponding path program 1 times [2018-12-02 06:08:57,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:08:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:08:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:08:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:08:57,265 INFO L87 Difference]: Start difference. First operand 6502 states and 14667 transitions. Second operand 5 states. [2018-12-02 06:08:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:57,336 INFO L93 Difference]: Finished difference Result 7021 states and 15780 transitions. [2018-12-02 06:08:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:08:57,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 06:08:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:57,340 INFO L225 Difference]: With dead ends: 7021 [2018-12-02 06:08:57,341 INFO L226 Difference]: Without dead ends: 7021 [2018-12-02 06:08:57,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2018-12-02 06:08:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 5427. [2018-12-02 06:08:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2018-12-02 06:08:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 12244 transitions. [2018-12-02 06:08:57,385 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 12244 transitions. Word has length 96 [2018-12-02 06:08:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:57,385 INFO L480 AbstractCegarLoop]: Abstraction has 5427 states and 12244 transitions. [2018-12-02 06:08:57,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:08:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 12244 transitions. [2018-12-02 06:08:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:57,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:57,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:57,389 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:57,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 755323252, now seen corresponding path program 1 times [2018-12-02 06:08:57,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:57,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:57,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:57,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:57,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:57,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:57,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:57,426 INFO L87 Difference]: Start difference. First operand 5427 states and 12244 transitions. Second operand 4 states. [2018-12-02 06:08:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:57,496 INFO L93 Difference]: Finished difference Result 6010 states and 13580 transitions. [2018-12-02 06:08:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:08:57,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 06:08:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:57,502 INFO L225 Difference]: With dead ends: 6010 [2018-12-02 06:08:57,502 INFO L226 Difference]: Without dead ends: 6010 [2018-12-02 06:08:57,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2018-12-02 06:08:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 5525. [2018-12-02 06:08:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5525 states. [2018-12-02 06:08:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5525 states to 5525 states and 12454 transitions. [2018-12-02 06:08:57,552 INFO L78 Accepts]: Start accepts. Automaton has 5525 states and 12454 transitions. Word has length 96 [2018-12-02 06:08:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:57,552 INFO L480 AbstractCegarLoop]: Abstraction has 5525 states and 12454 transitions. [2018-12-02 06:08:57,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5525 states and 12454 transitions. [2018-12-02 06:08:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:57,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:57,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:57,556 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1552162284, now seen corresponding path program 1 times [2018-12-02 06:08:57,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:57,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:08:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:08:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:08:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:08:57,587 INFO L87 Difference]: Start difference. First operand 5525 states and 12454 transitions. Second operand 4 states. [2018-12-02 06:08:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:57,746 INFO L93 Difference]: Finished difference Result 7095 states and 15865 transitions. [2018-12-02 06:08:57,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:08:57,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 06:08:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:57,751 INFO L225 Difference]: With dead ends: 7095 [2018-12-02 06:08:57,751 INFO L226 Difference]: Without dead ends: 7030 [2018-12-02 06:08:57,751 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-02 06:08:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7030 states. [2018-12-02 06:08:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7030 to 6606. [2018-12-02 06:08:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6606 states. [2018-12-02 06:08:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 14834 transitions. [2018-12-02 06:08:57,806 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 14834 transitions. Word has length 96 [2018-12-02 06:08:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:57,806 INFO L480 AbstractCegarLoop]: Abstraction has 6606 states and 14834 transitions. [2018-12-02 06:08:57,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:08:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 14834 transitions. [2018-12-02 06:08:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:57,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:57,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:57,812 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:57,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1321886091, now seen corresponding path program 1 times [2018-12-02 06:08:57,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:08:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:08:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:08:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:08:57,873 INFO L87 Difference]: Start difference. First operand 6606 states and 14834 transitions. Second operand 7 states. [2018-12-02 06:08:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:58,096 INFO L93 Difference]: Finished difference Result 8636 states and 19321 transitions. [2018-12-02 06:08:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 06:08:58,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:08:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:58,103 INFO L225 Difference]: With dead ends: 8636 [2018-12-02 06:08:58,103 INFO L226 Difference]: Without dead ends: 8636 [2018-12-02 06:08:58,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:08:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8636 states. [2018-12-02 06:08:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8636 to 7789. [2018-12-02 06:08:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7789 states. [2018-12-02 06:08:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 17445 transitions. [2018-12-02 06:08:58,164 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 17445 transitions. Word has length 96 [2018-12-02 06:08:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:58,164 INFO L480 AbstractCegarLoop]: Abstraction has 7789 states and 17445 transitions. [2018-12-02 06:08:58,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:08:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 17445 transitions. [2018-12-02 06:08:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:58,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:58,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:58,170 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:58,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 665595669, now seen corresponding path program 1 times [2018-12-02 06:08:58,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:58,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:58,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:58,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:08:58,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:08:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:08:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:08:58,280 INFO L87 Difference]: Start difference. First operand 7789 states and 17445 transitions. Second operand 9 states. [2018-12-02 06:08:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:58,647 INFO L93 Difference]: Finished difference Result 9896 states and 21868 transitions. [2018-12-02 06:08:58,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 06:08:58,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 06:08:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:58,653 INFO L225 Difference]: With dead ends: 9896 [2018-12-02 06:08:58,653 INFO L226 Difference]: Without dead ends: 9896 [2018-12-02 06:08:58,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:08:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9896 states. [2018-12-02 06:08:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9896 to 8582. [2018-12-02 06:08:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8582 states. [2018-12-02 06:08:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 19066 transitions. [2018-12-02 06:08:58,717 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 19066 transitions. Word has length 96 [2018-12-02 06:08:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:58,717 INFO L480 AbstractCegarLoop]: Abstraction has 8582 states and 19066 transitions. [2018-12-02 06:08:58,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:08:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 19066 transitions. [2018-12-02 06:08:58,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:58,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:58,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:58,722 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:58,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:58,723 INFO L82 PathProgramCache]: Analyzing trace with hash 876946582, now seen corresponding path program 1 times [2018-12-02 06:08:58,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:58,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:58,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:08:58,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:08:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:08:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:08:58,822 INFO L87 Difference]: Start difference. First operand 8582 states and 19066 transitions. Second operand 9 states. [2018-12-02 06:08:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:59,075 INFO L93 Difference]: Finished difference Result 10308 states and 22739 transitions. [2018-12-02 06:08:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 06:08:59,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 06:08:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:59,081 INFO L225 Difference]: With dead ends: 10308 [2018-12-02 06:08:59,081 INFO L226 Difference]: Without dead ends: 10177 [2018-12-02 06:08:59,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 06:08:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10177 states. [2018-12-02 06:08:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10177 to 6927. [2018-12-02 06:08:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6927 states. [2018-12-02 06:08:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6927 states to 6927 states and 15428 transitions. [2018-12-02 06:08:59,143 INFO L78 Accepts]: Start accepts. Automaton has 6927 states and 15428 transitions. Word has length 96 [2018-12-02 06:08:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:59,143 INFO L480 AbstractCegarLoop]: Abstraction has 6927 states and 15428 transitions. [2018-12-02 06:08:59,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:08:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6927 states and 15428 transitions. [2018-12-02 06:08:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:08:59,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:59,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, 1, 1, 1] [2018-12-02 06:08:59,148 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:08:59,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1764450263, now seen corresponding path program 1 times [2018-12-02 06:08:59,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:59,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:59,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:59,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 06:08:59,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:08:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:08:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:08:59,248 INFO L87 Difference]: Start difference. First operand 6927 states and 15428 transitions. Second operand 11 states. [2018-12-02 06:09:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:00,147 INFO L93 Difference]: Finished difference Result 12952 states and 28989 transitions. [2018-12-02 06:09:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 06:09:00,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 06:09:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:00,155 INFO L225 Difference]: With dead ends: 12952 [2018-12-02 06:09:00,155 INFO L226 Difference]: Without dead ends: 8957 [2018-12-02 06:09:00,156 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-02 06:09:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2018-12-02 06:09:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 6751. [2018-12-02 06:09:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6751 states. [2018-12-02 06:09:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6751 states to 6751 states and 14998 transitions. [2018-12-02 06:09:00,215 INFO L78 Accepts]: Start accepts. Automaton has 6751 states and 14998 transitions. Word has length 96 [2018-12-02 06:09:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:00,215 INFO L480 AbstractCegarLoop]: Abstraction has 6751 states and 14998 transitions. [2018-12-02 06:09:00,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:09:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 6751 states and 14998 transitions. [2018-12-02 06:09:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:00,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:00,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:00,220 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:00,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:00,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1504311231, now seen corresponding path program 1 times [2018-12-02 06:09:00,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:00,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:00,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:09:00,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:09:00,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:09:00,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:09:00,253 INFO L87 Difference]: Start difference. First operand 6751 states and 14998 transitions. Second operand 5 states. [2018-12-02 06:09:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:00,400 INFO L93 Difference]: Finished difference Result 6166 states and 13497 transitions. [2018-12-02 06:09:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:09:00,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 06:09:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:00,404 INFO L225 Difference]: With dead ends: 6166 [2018-12-02 06:09:00,404 INFO L226 Difference]: Without dead ends: 6166 [2018-12-02 06:09:00,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:09:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2018-12-02 06:09:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 5734. [2018-12-02 06:09:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2018-12-02 06:09:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 12590 transitions. [2018-12-02 06:09:00,443 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 12590 transitions. Word has length 96 [2018-12-02 06:09:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:00,443 INFO L480 AbstractCegarLoop]: Abstraction has 5734 states and 12590 transitions. [2018-12-02 06:09:00,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:09:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 12590 transitions. [2018-12-02 06:09:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:00,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:00,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:00,447 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:00,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 700839058, now seen corresponding path program 1 times [2018-12-02 06:09:00,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:00,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:00,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:00,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:09:00,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:09:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:09:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:09:00,518 INFO L87 Difference]: Start difference. First operand 5734 states and 12590 transitions. Second operand 7 states. [2018-12-02 06:09:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:00,683 INFO L93 Difference]: Finished difference Result 7393 states and 16128 transitions. [2018-12-02 06:09:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:09:00,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:09:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:00,688 INFO L225 Difference]: With dead ends: 7393 [2018-12-02 06:09:00,688 INFO L226 Difference]: Without dead ends: 7349 [2018-12-02 06:09:00,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:09:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2018-12-02 06:09:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 6005. [2018-12-02 06:09:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6005 states. [2018-12-02 06:09:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 13184 transitions. [2018-12-02 06:09:00,731 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 13184 transitions. Word has length 96 [2018-12-02 06:09:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:00,731 INFO L480 AbstractCegarLoop]: Abstraction has 6005 states and 13184 transitions. [2018-12-02 06:09:00,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:09:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 13184 transitions. [2018-12-02 06:09:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:00,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:00,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:00,735 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:00,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:00,736 INFO L82 PathProgramCache]: Analyzing trace with hash 186250227, now seen corresponding path program 2 times [2018-12-02 06:09:00,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:00,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:00,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:00,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:00,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:00,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:09:00,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:09:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:09:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:09:00,786 INFO L87 Difference]: Start difference. First operand 6005 states and 13184 transitions. Second operand 6 states. [2018-12-02 06:09:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:00,941 INFO L93 Difference]: Finished difference Result 6811 states and 14983 transitions. [2018-12-02 06:09:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:09:00,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 06:09:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:00,946 INFO L225 Difference]: With dead ends: 6811 [2018-12-02 06:09:00,946 INFO L226 Difference]: Without dead ends: 6811 [2018-12-02 06:09:00,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:09:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6811 states. [2018-12-02 06:09:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6811 to 6217. [2018-12-02 06:09:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2018-12-02 06:09:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 13636 transitions. [2018-12-02 06:09:00,988 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 13636 transitions. Word has length 96 [2018-12-02 06:09:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:00,989 INFO L480 AbstractCegarLoop]: Abstraction has 6217 states and 13636 transitions. [2018-12-02 06:09:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:09:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 13636 transitions. [2018-12-02 06:09:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:00,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:00,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:00,993 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:00,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash 30022514, now seen corresponding path program 1 times [2018-12-02 06:09:00,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:09:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:01,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:01,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:09:01,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:09:01,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:09:01,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:09:01,044 INFO L87 Difference]: Start difference. First operand 6217 states and 13636 transitions. Second operand 6 states. [2018-12-02 06:09:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:01,337 INFO L93 Difference]: Finished difference Result 8725 states and 18969 transitions. [2018-12-02 06:09:01,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 06:09:01,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 06:09:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:01,343 INFO L225 Difference]: With dead ends: 8725 [2018-12-02 06:09:01,343 INFO L226 Difference]: Without dead ends: 8634 [2018-12-02 06:09:01,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:09:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2018-12-02 06:09:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 6865. [2018-12-02 06:09:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6865 states. [2018-12-02 06:09:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 15122 transitions. [2018-12-02 06:09:01,396 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 15122 transitions. Word has length 96 [2018-12-02 06:09:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:01,396 INFO L480 AbstractCegarLoop]: Abstraction has 6865 states and 15122 transitions. [2018-12-02 06:09:01,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:09:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 15122 transitions. [2018-12-02 06:09:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:01,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:01,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:01,401 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:01,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 241373427, now seen corresponding path program 1 times [2018-12-02 06:09:01,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:01,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:01,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:09:01,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:09:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:09:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:09:01,468 INFO L87 Difference]: Start difference. First operand 6865 states and 15122 transitions. Second operand 6 states. [2018-12-02 06:09:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:01,571 INFO L93 Difference]: Finished difference Result 7035 states and 15301 transitions. [2018-12-02 06:09:01,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:09:01,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 06:09:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:01,576 INFO L225 Difference]: With dead ends: 7035 [2018-12-02 06:09:01,576 INFO L226 Difference]: Without dead ends: 6981 [2018-12-02 06:09:01,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:09:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2018-12-02 06:09:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6129. [2018-12-02 06:09:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2018-12-02 06:09:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 13364 transitions. [2018-12-02 06:09:01,618 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 13364 transitions. Word has length 96 [2018-12-02 06:09:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:01,618 INFO L480 AbstractCegarLoop]: Abstraction has 6129 states and 13364 transitions. [2018-12-02 06:09:01,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:09:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 13364 transitions. [2018-12-02 06:09:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:01,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:01,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:01,622 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:01,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 723124211, now seen corresponding path program 1 times [2018-12-02 06:09:01,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:01,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:01,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:01,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:01,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:09:01,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 06:09:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 06:09:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:09:01,761 INFO L87 Difference]: Start difference. First operand 6129 states and 13364 transitions. Second operand 9 states. [2018-12-02 06:09:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:02,071 INFO L93 Difference]: Finished difference Result 7423 states and 15998 transitions. [2018-12-02 06:09:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:09:02,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 06:09:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:02,075 INFO L225 Difference]: With dead ends: 7423 [2018-12-02 06:09:02,075 INFO L226 Difference]: Without dead ends: 7423 [2018-12-02 06:09:02,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-02 06:09:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2018-12-02 06:09:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6404. [2018-12-02 06:09:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6404 states. [2018-12-02 06:09:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6404 states to 6404 states and 13925 transitions. [2018-12-02 06:09:02,121 INFO L78 Accepts]: Start accepts. Automaton has 6404 states and 13925 transitions. Word has length 96 [2018-12-02 06:09:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:02,121 INFO L480 AbstractCegarLoop]: Abstraction has 6404 states and 13925 transitions. [2018-12-02 06:09:02,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 06:09:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6404 states and 13925 transitions. [2018-12-02 06:09:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:02,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:02,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:02,126 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:02,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1890597876, now seen corresponding path program 1 times [2018-12-02 06:09:02,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:02,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:09:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:09:02,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:09:02,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 06:09:02,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:09:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:09:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:09:02,182 INFO L87 Difference]: Start difference. First operand 6404 states and 13925 transitions. Second operand 7 states. [2018-12-02 06:09:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:09:02,265 INFO L93 Difference]: Finished difference Result 8248 states and 18066 transitions. [2018-12-02 06:09:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:09:02,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 06:09:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:09:02,270 INFO L225 Difference]: With dead ends: 8248 [2018-12-02 06:09:02,271 INFO L226 Difference]: Without dead ends: 8248 [2018-12-02 06:09:02,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:09:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2018-12-02 06:09:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 5672. [2018-12-02 06:09:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5672 states. [2018-12-02 06:09:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 12304 transitions. [2018-12-02 06:09:02,315 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 12304 transitions. Word has length 96 [2018-12-02 06:09:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:09:02,315 INFO L480 AbstractCegarLoop]: Abstraction has 5672 states and 12304 transitions. [2018-12-02 06:09:02,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:09:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 12304 transitions. [2018-12-02 06:09:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 06:09:02,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:09:02,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:09:02,319 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 06:09:02,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:09:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash -575911691, now seen corresponding path program 2 times [2018-12-02 06:09:02,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:09:02,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:09:02,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:02,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:09:02,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:09:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:09:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:09:02,360 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 06:09:02,447 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 06:09:02,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:09:02 BasicIcfg [2018-12-02 06:09:02,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:09:02,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:09:02,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:09:02,450 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:09:02,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:08:35" (3/4) ... [2018-12-02 06:09:02,453 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 06:09:02,545 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d72b395-7b34-4b7f-9293-6e74272c0692/bin-2019/uautomizer/witness.graphml [2018-12-02 06:09:02,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:09:02,546 INFO L168 Benchmark]: Toolchain (without parser) took 28022.33 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 951.7 MB in the beginning and 1.3 GB in the end (delta: -387.4 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: Boogie Preprocessor took 20.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: RCFGBuilder took 340.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,547 INFO L168 Benchmark]: TraceAbstraction took 27216.02 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,548 INFO L168 Benchmark]: Witness Printer took 96.06 ms. Allocated memory is still 4.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:09:02,549 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 340.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27216.02 ms. Allocated memory was 1.2 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -340.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 96.06 ms. Allocated memory is still 4.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L775] -1 pthread_t t315; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L776] FCALL, FORK -1 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L777] -1 pthread_t t316; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L717] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L778] FCALL, FORK -1 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L741] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L741] 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) [L742] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L742] 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)) [L743] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L743] 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)) [L744] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L744] 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)) [L745] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L745] 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)) [L746] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L746] 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)) [L747] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L747] 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)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L717] 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) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L753] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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] [L753] 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) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_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] [L755] 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 [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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$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 [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L721] 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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L757] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L757] 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 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L784] -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) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L786] -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 [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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] [L788] -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 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=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, 223 locations, 3 error locations. UNSAFE Result, 27.1s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10124 SDtfs, 11802 SDslu, 22376 SDs, 0 SdLazy, 10136 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 94 SyntacticMatches, 44 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 11.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 190842 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2928 NumberOfCodeBlocks, 2928 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2794 ConstructedInterpolants, 0 QuantifiedInterpolants, 695780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...