./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/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 91d6ad7ac966b9170f1c4fb60f8a5eb3423f5597 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-cad4683 [2019-11-15 21:57:04,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:57:04,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:57:04,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:57:04,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:57:04,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:57:04,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:57:04,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:57:04,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:57:04,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:57:04,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:57:04,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:57:04,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:57:04,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:57:04,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:57:04,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:57:04,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:57:04,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:57:04,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:57:04,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:57:04,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:57:04,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:57:04,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:57:04,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:57:04,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:57:04,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:57:04,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:57:04,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:57:04,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:57:04,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:57:04,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:57:04,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:57:04,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:57:04,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:57:04,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:57:04,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:57:04,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:57:04,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:57:04,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:57:04,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:57:04,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:57:04,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:57:04,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:57:04,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:57:04,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:57:04,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:57:04,693 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:57:04,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:57:04,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:57:04,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:57:04,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:57:04,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:57:04,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:57:04,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:57:04,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:57:04,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:57:04,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:57:04,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:57:04,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:57:04,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:57:04,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:57:04,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:57:04,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:57:04,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:57:04,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:57:04,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:57:04,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:57:04,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:57:04,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:57:04,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:57:04,707 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/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 -> 91d6ad7ac966b9170f1c4fb60f8a5eb3423f5597 [2019-11-15 21:57:04,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:57:04,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:57:04,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:57:04,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:57:04,777 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:57:04,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i [2019-11-15 21:57:04,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/data/361a7f905/02559edcf783457d89878f3a427f91e2/FLAG9d760ceda [2019-11-15 21:57:05,490 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:57:05,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/sv-benchmarks/c/pthread-wmm/safe010_pso.opt.i [2019-11-15 21:57:05,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/data/361a7f905/02559edcf783457d89878f3a427f91e2/FLAG9d760ceda [2019-11-15 21:57:05,748 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/data/361a7f905/02559edcf783457d89878f3a427f91e2 [2019-11-15 21:57:05,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:57:05,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:57:05,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:57:05,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:57:05,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:57:05,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:57:05" (1/1) ... [2019-11-15 21:57:05,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4720b07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:05, skipping insertion in model container [2019-11-15 21:57:05,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:57:05" (1/1) ... [2019-11-15 21:57:05,778 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:57:05,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:57:06,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:57:06,458 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:57:06,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:57:06,629 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:57:06,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06 WrapperNode [2019-11-15 21:57:06,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:57:06,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:57:06,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:57:06,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:57:06,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:57:06,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:57:06,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:57:06,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:57:06,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... [2019-11-15 21:57:06,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:57:06,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:57:06,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:57:06,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:57:06,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/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 [2019-11-15 21:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:57:06,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:57:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:57:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:57:06,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:57:06,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:57:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:57:06,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:57:06,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:57:06,837 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 21:57:07,861 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:57:07,861 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:57:07,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:57:07 BoogieIcfgContainer [2019-11-15 21:57:07,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:57:07,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:57:07,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:57:07,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:57:07,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:57:05" (1/3) ... [2019-11-15 21:57:07,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f511034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:57:07, skipping insertion in model container [2019-11-15 21:57:07,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:57:06" (2/3) ... [2019-11-15 21:57:07,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f511034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:57:07, skipping insertion in model container [2019-11-15 21:57:07,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:57:07" (3/3) ... [2019-11-15 21:57:07,871 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2019-11-15 21:57:07,924 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,925 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,925 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,925 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,925 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,925 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,926 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,926 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,927 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,927 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,927 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,927 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,928 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,928 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,928 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,928 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,929 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,929 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,929 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,929 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,934 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,934 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,934 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,935 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,936 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,937 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,938 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,939 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,940 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,941 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:57:07,948 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:57:07,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:57:07,957 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:57:07,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:57:07,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:57:07,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:57:07,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:57:07,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:57:07,998 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:57:07,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:57:07,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:57:07,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:57:08,014 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-15 21:57:10,022 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-11-15 21:57:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-11-15 21:57:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:57:10,034 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:10,035 INFO L380 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] [2019-11-15 21:57:10,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash 733594359, now seen corresponding path program 1 times [2019-11-15 21:57:10,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:10,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374018308] [2019-11-15 21:57:10,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:10,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:10,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374018308] [2019-11-15 21:57:10,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:10,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:57:10,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363265583] [2019-11-15 21:57:10,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:57:10,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:57:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:57:10,436 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-11-15 21:57:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:11,189 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-11-15 21:57:11,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:57:11,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 21:57:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:11,483 INFO L225 Difference]: With dead ends: 23453 [2019-11-15 21:57:11,483 INFO L226 Difference]: Without dead ends: 21277 [2019-11-15 21:57:11,485 INFO L600 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 [2019-11-15 21:57:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-11-15 21:57:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-11-15 21:57:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-11-15 21:57:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-11-15 21:57:13,384 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-11-15 21:57:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:13,386 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-11-15 21:57:13,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:57:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-11-15 21:57:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:57:13,402 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:13,402 INFO L380 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] [2019-11-15 21:57:13,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1574494247, now seen corresponding path program 1 times [2019-11-15 21:57:13,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:13,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203400961] [2019-11-15 21:57:13,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:13,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:13,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:13,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203400961] [2019-11-15 21:57:13,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:13,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:13,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259755416] [2019-11-15 21:57:13,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:13,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:13,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:13,596 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-11-15 21:57:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:15,102 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-11-15 21:57:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:15,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 21:57:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:15,311 INFO L225 Difference]: With dead ends: 34711 [2019-11-15 21:57:15,312 INFO L226 Difference]: Without dead ends: 34567 [2019-11-15 21:57:15,313 INFO L600 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 [2019-11-15 21:57:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-11-15 21:57:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-11-15 21:57:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-11-15 21:57:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-11-15 21:57:17,037 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-11-15 21:57:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:17,040 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-11-15 21:57:17,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-11-15 21:57:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:57:17,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:17,049 INFO L380 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] [2019-11-15 21:57:17,049 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash -606075449, now seen corresponding path program 1 times [2019-11-15 21:57:17,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:17,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903969493] [2019-11-15 21:57:17,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:17,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:17,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:17,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903969493] [2019-11-15 21:57:17,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:17,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:17,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489442893] [2019-11-15 21:57:17,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:17,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:17,135 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-11-15 21:57:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:18,321 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-11-15 21:57:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:18,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 21:57:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:18,523 INFO L225 Difference]: With dead ends: 40219 [2019-11-15 21:57:18,524 INFO L226 Difference]: Without dead ends: 40059 [2019-11-15 21:57:18,525 INFO L600 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 [2019-11-15 21:57:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-11-15 21:57:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-11-15 21:57:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-11-15 21:57:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-11-15 21:57:19,739 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-11-15 21:57:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:19,740 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-11-15 21:57:19,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-11-15 21:57:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:57:19,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:19,758 INFO L380 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] [2019-11-15 21:57:19,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash 905685778, now seen corresponding path program 1 times [2019-11-15 21:57:19,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:19,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340593899] [2019-11-15 21:57:19,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:19,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:19,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:19,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340593899] [2019-11-15 21:57:19,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:19,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:19,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890744170] [2019-11-15 21:57:19,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:19,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:19,875 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-11-15 21:57:21,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:21,714 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-11-15 21:57:21,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:57:21,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:57:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:22,033 INFO L225 Difference]: With dead ends: 45668 [2019-11-15 21:57:22,033 INFO L226 Difference]: Without dead ends: 45524 [2019-11-15 21:57:22,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:57:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-11-15 21:57:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-11-15 21:57:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-11-15 21:57:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-11-15 21:57:23,049 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-11-15 21:57:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:23,050 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-11-15 21:57:23,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-11-15 21:57:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:57:23,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:23,092 INFO L380 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] [2019-11-15 21:57:23,093 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1972912513, now seen corresponding path program 1 times [2019-11-15 21:57:23,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:23,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179076009] [2019-11-15 21:57:23,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:23,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:23,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:23,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179076009] [2019-11-15 21:57:23,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:23,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:23,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101309235] [2019-11-15 21:57:23,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:23,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:23,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:23,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:23,202 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-11-15 21:57:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:24,413 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-11-15 21:57:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:57:24,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-15 21:57:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:24,556 INFO L225 Difference]: With dead ends: 46075 [2019-11-15 21:57:24,556 INFO L226 Difference]: Without dead ends: 45835 [2019-11-15 21:57:24,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:57:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-11-15 21:57:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-11-15 21:57:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-11-15 21:57:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-11-15 21:57:25,518 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-11-15 21:57:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:25,518 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-11-15 21:57:25,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-11-15 21:57:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:57:25,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:25,558 INFO L380 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] [2019-11-15 21:57:25,559 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:25,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:25,559 INFO L82 PathProgramCache]: Analyzing trace with hash -207346572, now seen corresponding path program 1 times [2019-11-15 21:57:25,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:25,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134175080] [2019-11-15 21:57:25,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:25,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:25,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:25,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134175080] [2019-11-15 21:57:25,626 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:25,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:57:25,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701442079] [2019-11-15 21:57:25,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:57:25,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:57:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:57:25,630 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-11-15 21:57:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:25,891 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-11-15 21:57:25,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:57:25,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-15 21:57:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:26,037 INFO L225 Difference]: With dead ends: 50262 [2019-11-15 21:57:26,038 INFO L226 Difference]: Without dead ends: 50262 [2019-11-15 21:57:26,038 INFO L600 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 [2019-11-15 21:57:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-11-15 21:57:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-11-15 21:57:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-11-15 21:57:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-11-15 21:57:27,632 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-11-15 21:57:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-11-15 21:57:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:57:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-11-15 21:57:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:57:27,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:27,677 INFO L380 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] [2019-11-15 21:57:27,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 280232242, now seen corresponding path program 1 times [2019-11-15 21:57:27,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:27,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837799266] [2019-11-15 21:57:27,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:27,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:27,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837799266] [2019-11-15 21:57:27,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:27,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:27,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759333047] [2019-11-15 21:57:27,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:27,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:27,795 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-11-15 21:57:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:29,191 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-11-15 21:57:29,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:57:29,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-15 21:57:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:29,384 INFO L225 Difference]: With dead ends: 55890 [2019-11-15 21:57:29,385 INFO L226 Difference]: Without dead ends: 55650 [2019-11-15 21:57:29,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:57:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-11-15 21:57:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-11-15 21:57:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-11-15 21:57:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-11-15 21:57:30,591 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-11-15 21:57:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:30,592 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-11-15 21:57:30,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-11-15 21:57:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:57:30,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:30,636 INFO L380 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] [2019-11-15 21:57:30,637 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1547139530, now seen corresponding path program 1 times [2019-11-15 21:57:30,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:30,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248144629] [2019-11-15 21:57:30,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:30,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:30,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:31,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248144629] [2019-11-15 21:57:31,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:31,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:31,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918790905] [2019-11-15 21:57:31,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:31,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:31,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:31,320 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 5 states. [2019-11-15 21:57:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:32,940 INFO L93 Difference]: Finished difference Result 115002 states and 419394 transitions. [2019-11-15 21:57:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:32,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:57:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:33,267 INFO L225 Difference]: With dead ends: 115002 [2019-11-15 21:57:33,267 INFO L226 Difference]: Without dead ends: 114262 [2019-11-15 21:57:33,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:57:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114262 states. [2019-11-15 21:57:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114262 to 64599. [2019-11-15 21:57:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64599 states. [2019-11-15 21:57:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64599 states to 64599 states and 236588 transitions. [2019-11-15 21:57:35,166 INFO L78 Accepts]: Start accepts. Automaton has 64599 states and 236588 transitions. Word has length 65 [2019-11-15 21:57:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:35,166 INFO L462 AbstractCegarLoop]: Abstraction has 64599 states and 236588 transitions. [2019-11-15 21:57:35,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 64599 states and 236588 transitions. [2019-11-15 21:57:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:57:35,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:35,223 INFO L380 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] [2019-11-15 21:57:35,223 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1184022475, now seen corresponding path program 1 times [2019-11-15 21:57:35,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:35,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055068968] [2019-11-15 21:57:35,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:35,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:35,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:35,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055068968] [2019-11-15 21:57:35,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:35,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:35,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84847754] [2019-11-15 21:57:35,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:35,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:35,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:35,363 INFO L87 Difference]: Start difference. First operand 64599 states and 236588 transitions. Second operand 6 states. [2019-11-15 21:57:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:36,919 INFO L93 Difference]: Finished difference Result 71048 states and 257943 transitions. [2019-11-15 21:57:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:36,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:57:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:37,108 INFO L225 Difference]: With dead ends: 71048 [2019-11-15 21:57:37,108 INFO L226 Difference]: Without dead ends: 71048 [2019-11-15 21:57:37,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71048 states. [2019-11-15 21:57:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71048 to 65451. [2019-11-15 21:57:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65451 states. [2019-11-15 21:57:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65451 states to 65451 states and 239375 transitions. [2019-11-15 21:57:38,491 INFO L78 Accepts]: Start accepts. Automaton has 65451 states and 239375 transitions. Word has length 65 [2019-11-15 21:57:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:38,491 INFO L462 AbstractCegarLoop]: Abstraction has 65451 states and 239375 transitions. [2019-11-15 21:57:38,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 65451 states and 239375 transitions. [2019-11-15 21:57:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:57:38,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:38,563 INFO L380 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] [2019-11-15 21:57:38,563 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1183167156, now seen corresponding path program 1 times [2019-11-15 21:57:38,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:38,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795772055] [2019-11-15 21:57:38,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:38,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:38,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:38,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795772055] [2019-11-15 21:57:38,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:38,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:38,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824490389] [2019-11-15 21:57:38,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:38,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:38,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:38,677 INFO L87 Difference]: Start difference. First operand 65451 states and 239375 transitions. Second operand 7 states. [2019-11-15 21:57:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:40,016 INFO L93 Difference]: Finished difference Result 75675 states and 272886 transitions. [2019-11-15 21:57:40,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:57:40,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 21:57:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:40,207 INFO L225 Difference]: With dead ends: 75675 [2019-11-15 21:57:40,207 INFO L226 Difference]: Without dead ends: 75475 [2019-11-15 21:57:40,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:57:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75475 states. [2019-11-15 21:57:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75475 to 66329. [2019-11-15 21:57:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66329 states. [2019-11-15 21:57:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66329 states to 66329 states and 242246 transitions. [2019-11-15 21:57:42,336 INFO L78 Accepts]: Start accepts. Automaton has 66329 states and 242246 transitions. Word has length 65 [2019-11-15 21:57:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:42,337 INFO L462 AbstractCegarLoop]: Abstraction has 66329 states and 242246 transitions. [2019-11-15 21:57:42,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 66329 states and 242246 transitions. [2019-11-15 21:57:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 21:57:42,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:42,412 INFO L380 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] [2019-11-15 21:57:42,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:42,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1502327268, now seen corresponding path program 1 times [2019-11-15 21:57:42,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:42,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828076339] [2019-11-15 21:57:42,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:42,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:42,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:42,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828076339] [2019-11-15 21:57:42,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:42,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:57:42,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221851481] [2019-11-15 21:57:42,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:57:42,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:42,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:57:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:57:42,525 INFO L87 Difference]: Start difference. First operand 66329 states and 242246 transitions. Second operand 3 states. [2019-11-15 21:57:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:42,916 INFO L93 Difference]: Finished difference Result 64370 states and 233071 transitions. [2019-11-15 21:57:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:57:42,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 21:57:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:43,086 INFO L225 Difference]: With dead ends: 64370 [2019-11-15 21:57:43,086 INFO L226 Difference]: Without dead ends: 64208 [2019-11-15 21:57:43,087 INFO L600 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 [2019-11-15 21:57:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64208 states. [2019-11-15 21:57:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64208 to 64180. [2019-11-15 21:57:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64180 states. [2019-11-15 21:57:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64180 states to 64180 states and 232443 transitions. [2019-11-15 21:57:44,423 INFO L78 Accepts]: Start accepts. Automaton has 64180 states and 232443 transitions. Word has length 67 [2019-11-15 21:57:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:44,424 INFO L462 AbstractCegarLoop]: Abstraction has 64180 states and 232443 transitions. [2019-11-15 21:57:44,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:57:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 64180 states and 232443 transitions. [2019-11-15 21:57:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 21:57:44,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:44,487 INFO L380 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] [2019-11-15 21:57:44,487 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1470674241, now seen corresponding path program 1 times [2019-11-15 21:57:44,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:44,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424725560] [2019-11-15 21:57:44,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:44,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:44,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:44,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424725560] [2019-11-15 21:57:44,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:44,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:57:44,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682408080] [2019-11-15 21:57:44,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:57:44,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:57:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:57:44,638 INFO L87 Difference]: Start difference. First operand 64180 states and 232443 transitions. Second operand 4 states. [2019-11-15 21:57:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:44,735 INFO L93 Difference]: Finished difference Result 16840 states and 53043 transitions. [2019-11-15 21:57:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:57:44,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 21:57:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:44,764 INFO L225 Difference]: With dead ends: 16840 [2019-11-15 21:57:44,764 INFO L226 Difference]: Without dead ends: 16137 [2019-11-15 21:57:44,765 INFO L600 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 [2019-11-15 21:57:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-11-15 21:57:44,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16001. [2019-11-15 21:57:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16001 states. [2019-11-15 21:57:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16001 states to 16001 states and 50461 transitions. [2019-11-15 21:57:45,026 INFO L78 Accepts]: Start accepts. Automaton has 16001 states and 50461 transitions. Word has length 68 [2019-11-15 21:57:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:45,026 INFO L462 AbstractCegarLoop]: Abstraction has 16001 states and 50461 transitions. [2019-11-15 21:57:45,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:57:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 16001 states and 50461 transitions. [2019-11-15 21:57:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:57:45,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:45,040 INFO L380 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] [2019-11-15 21:57:45,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1982614502, now seen corresponding path program 1 times [2019-11-15 21:57:45,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:45,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173323369] [2019-11-15 21:57:45,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:45,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:45,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:45,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173323369] [2019-11-15 21:57:45,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:45,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:57:45,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436960476] [2019-11-15 21:57:45,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:45,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:45,218 INFO L87 Difference]: Start difference. First operand 16001 states and 50461 transitions. Second operand 8 states. [2019-11-15 21:57:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:46,412 INFO L93 Difference]: Finished difference Result 17894 states and 55974 transitions. [2019-11-15 21:57:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:57:46,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-11-15 21:57:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:46,443 INFO L225 Difference]: With dead ends: 17894 [2019-11-15 21:57:46,443 INFO L226 Difference]: Without dead ends: 17846 [2019-11-15 21:57:46,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:57:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17846 states. [2019-11-15 21:57:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17846 to 16094. [2019-11-15 21:57:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16094 states. [2019-11-15 21:57:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16094 states to 16094 states and 50886 transitions. [2019-11-15 21:57:46,744 INFO L78 Accepts]: Start accepts. Automaton has 16094 states and 50886 transitions. Word has length 77 [2019-11-15 21:57:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:46,745 INFO L462 AbstractCegarLoop]: Abstraction has 16094 states and 50886 transitions. [2019-11-15 21:57:46,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 16094 states and 50886 transitions. [2019-11-15 21:57:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:57:46,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:46,762 INFO L380 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] [2019-11-15 21:57:46,763 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1432922001, now seen corresponding path program 1 times [2019-11-15 21:57:46,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:46,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524059938] [2019-11-15 21:57:46,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:46,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:46,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:46,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524059938] [2019-11-15 21:57:46,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:46,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:46,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352448006] [2019-11-15 21:57:46,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:46,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:46,939 INFO L87 Difference]: Start difference. First operand 16094 states and 50886 transitions. Second operand 6 states. [2019-11-15 21:57:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:47,690 INFO L93 Difference]: Finished difference Result 17857 states and 55827 transitions. [2019-11-15 21:57:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:47,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-15 21:57:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:47,738 INFO L225 Difference]: With dead ends: 17857 [2019-11-15 21:57:47,738 INFO L226 Difference]: Without dead ends: 17857 [2019-11-15 21:57:47,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17857 states. [2019-11-15 21:57:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17857 to 17110. [2019-11-15 21:57:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2019-11-15 21:57:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 53670 transitions. [2019-11-15 21:57:48,426 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 53670 transitions. Word has length 80 [2019-11-15 21:57:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:48,426 INFO L462 AbstractCegarLoop]: Abstraction has 17110 states and 53670 transitions. [2019-11-15 21:57:48,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 53670 transitions. [2019-11-15 21:57:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:57:48,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:48,447 INFO L380 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] [2019-11-15 21:57:48,447 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 926385008, now seen corresponding path program 1 times [2019-11-15 21:57:48,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:48,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876012848] [2019-11-15 21:57:48,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:48,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:48,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:48,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876012848] [2019-11-15 21:57:48,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:48,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:48,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900040804] [2019-11-15 21:57:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:48,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:48,586 INFO L87 Difference]: Start difference. First operand 17110 states and 53670 transitions. Second operand 7 states. [2019-11-15 21:57:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:49,263 INFO L93 Difference]: Finished difference Result 18508 states and 57510 transitions. [2019-11-15 21:57:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:57:49,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-11-15 21:57:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:49,295 INFO L225 Difference]: With dead ends: 18508 [2019-11-15 21:57:49,295 INFO L226 Difference]: Without dead ends: 18508 [2019-11-15 21:57:49,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:57:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-11-15 21:57:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 17958. [2019-11-15 21:57:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17958 states. [2019-11-15 21:57:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17958 states to 17958 states and 55879 transitions. [2019-11-15 21:57:49,577 INFO L78 Accepts]: Start accepts. Automaton has 17958 states and 55879 transitions. Word has length 80 [2019-11-15 21:57:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:49,577 INFO L462 AbstractCegarLoop]: Abstraction has 17958 states and 55879 transitions. [2019-11-15 21:57:49,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17958 states and 55879 transitions. [2019-11-15 21:57:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:57:49,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:49,597 INFO L380 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] [2019-11-15 21:57:49,598 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:49,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1256150769, now seen corresponding path program 1 times [2019-11-15 21:57:49,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:49,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578452982] [2019-11-15 21:57:49,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:49,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:49,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:49,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578452982] [2019-11-15 21:57:49,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:49,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:49,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560602703] [2019-11-15 21:57:49,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:49,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:49,707 INFO L87 Difference]: Start difference. First operand 17958 states and 55879 transitions. Second operand 5 states. [2019-11-15 21:57:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:49,764 INFO L93 Difference]: Finished difference Result 2868 states and 7083 transitions. [2019-11-15 21:57:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:57:49,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-15 21:57:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:49,769 INFO L225 Difference]: With dead ends: 2868 [2019-11-15 21:57:49,769 INFO L226 Difference]: Without dead ends: 2485 [2019-11-15 21:57:49,769 INFO L600 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 [2019-11-15 21:57:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2019-11-15 21:57:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2306. [2019-11-15 21:57:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-11-15 21:57:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 5659 transitions. [2019-11-15 21:57:49,808 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 5659 transitions. Word has length 80 [2019-11-15 21:57:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:49,809 INFO L462 AbstractCegarLoop]: Abstraction has 2306 states and 5659 transitions. [2019-11-15 21:57:49,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 5659 transitions. [2019-11-15 21:57:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:49,812 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:49,813 INFO L380 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] [2019-11-15 21:57:49,813 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2110018715, now seen corresponding path program 1 times [2019-11-15 21:57:49,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:49,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830300247] [2019-11-15 21:57:49,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:49,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:49,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:49,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830300247] [2019-11-15 21:57:49,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:49,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:57:49,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955879126] [2019-11-15 21:57:49,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:49,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:49,974 INFO L87 Difference]: Start difference. First operand 2306 states and 5659 transitions. Second operand 8 states. [2019-11-15 21:57:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:50,817 INFO L93 Difference]: Finished difference Result 3599 states and 8662 transitions. [2019-11-15 21:57:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:57:50,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-11-15 21:57:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:50,822 INFO L225 Difference]: With dead ends: 3599 [2019-11-15 21:57:50,822 INFO L226 Difference]: Without dead ends: 3545 [2019-11-15 21:57:50,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:57:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-11-15 21:57:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2708. [2019-11-15 21:57:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-11-15 21:57:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 6589 transitions. [2019-11-15 21:57:50,856 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 6589 transitions. Word has length 92 [2019-11-15 21:57:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:50,857 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 6589 transitions. [2019-11-15 21:57:50,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 6589 transitions. [2019-11-15 21:57:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:50,859 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:50,860 INFO L380 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] [2019-11-15 21:57:50,860 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 21429917, now seen corresponding path program 1 times [2019-11-15 21:57:50,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:50,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286465724] [2019-11-15 21:57:50,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:50,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:50,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:50,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286465724] [2019-11-15 21:57:50,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:50,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:57:50,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611186214] [2019-11-15 21:57:50,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:57:50,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:57:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:57:50,930 INFO L87 Difference]: Start difference. First operand 2708 states and 6589 transitions. Second operand 4 states. [2019-11-15 21:57:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:51,107 INFO L93 Difference]: Finished difference Result 3396 states and 8113 transitions. [2019-11-15 21:57:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:57:51,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 21:57:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:51,111 INFO L225 Difference]: With dead ends: 3396 [2019-11-15 21:57:51,111 INFO L226 Difference]: Without dead ends: 3354 [2019-11-15 21:57:51,112 INFO L600 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 [2019-11-15 21:57:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-11-15 21:57:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 2934. [2019-11-15 21:57:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-11-15 21:57:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 7096 transitions. [2019-11-15 21:57:51,147 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 7096 transitions. Word has length 92 [2019-11-15 21:57:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:51,147 INFO L462 AbstractCegarLoop]: Abstraction has 2934 states and 7096 transitions. [2019-11-15 21:57:51,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:57:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 7096 transitions. [2019-11-15 21:57:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:51,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:51,150 INFO L380 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] [2019-11-15 21:57:51,150 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 190034838, now seen corresponding path program 1 times [2019-11-15 21:57:51,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:51,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213818162] [2019-11-15 21:57:51,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:51,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213818162] [2019-11-15 21:57:51,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:51,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:51,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407193627] [2019-11-15 21:57:51,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:51,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:51,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:51,343 INFO L87 Difference]: Start difference. First operand 2934 states and 7096 transitions. Second operand 7 states. [2019-11-15 21:57:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:51,699 INFO L93 Difference]: Finished difference Result 3388 states and 8060 transitions. [2019-11-15 21:57:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:57:51,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-11-15 21:57:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:51,703 INFO L225 Difference]: With dead ends: 3388 [2019-11-15 21:57:51,704 INFO L226 Difference]: Without dead ends: 3388 [2019-11-15 21:57:51,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-11-15 21:57:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3194. [2019-11-15 21:57:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-11-15 21:57:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 7672 transitions. [2019-11-15 21:57:51,746 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 7672 transitions. Word has length 92 [2019-11-15 21:57:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:51,746 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 7672 transitions. [2019-11-15 21:57:51,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 7672 transitions. [2019-11-15 21:57:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:51,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:51,750 INFO L380 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] [2019-11-15 21:57:51,750 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 519800599, now seen corresponding path program 1 times [2019-11-15 21:57:51,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:51,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087271723] [2019-11-15 21:57:51,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:51,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087271723] [2019-11-15 21:57:51,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:51,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:57:51,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405294265] [2019-11-15 21:57:51,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:57:51,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:57:51,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:57:51,935 INFO L87 Difference]: Start difference. First operand 3194 states and 7672 transitions. Second operand 9 states. [2019-11-15 21:57:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:52,730 INFO L93 Difference]: Finished difference Result 3889 states and 9127 transitions. [2019-11-15 21:57:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:57:52,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-11-15 21:57:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:52,735 INFO L225 Difference]: With dead ends: 3889 [2019-11-15 21:57:52,735 INFO L226 Difference]: Without dead ends: 3865 [2019-11-15 21:57:52,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:57:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2019-11-15 21:57:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3469. [2019-11-15 21:57:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2019-11-15 21:57:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 8282 transitions. [2019-11-15 21:57:52,776 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 8282 transitions. Word has length 92 [2019-11-15 21:57:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:52,776 INFO L462 AbstractCegarLoop]: Abstraction has 3469 states and 8282 transitions. [2019-11-15 21:57:52,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:57:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 8282 transitions. [2019-11-15 21:57:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:52,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:52,780 INFO L380 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] [2019-11-15 21:57:52,780 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash 672729110, now seen corresponding path program 1 times [2019-11-15 21:57:52,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:52,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793037442] [2019-11-15 21:57:52,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:52,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:52,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:52,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793037442] [2019-11-15 21:57:52,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:52,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:52,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495774513] [2019-11-15 21:57:52,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:52,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:52,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:52,904 INFO L87 Difference]: Start difference. First operand 3469 states and 8282 transitions. Second operand 7 states. [2019-11-15 21:57:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:53,680 INFO L93 Difference]: Finished difference Result 5314 states and 12423 transitions. [2019-11-15 21:57:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:57:53,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-11-15 21:57:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:53,689 INFO L225 Difference]: With dead ends: 5314 [2019-11-15 21:57:53,689 INFO L226 Difference]: Without dead ends: 5278 [2019-11-15 21:57:53,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:57:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2019-11-15 21:57:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 4370. [2019-11-15 21:57:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4370 states. [2019-11-15 21:57:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 10359 transitions. [2019-11-15 21:57:53,770 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 10359 transitions. Word has length 92 [2019-11-15 21:57:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:53,770 INFO L462 AbstractCegarLoop]: Abstraction has 4370 states and 10359 transitions. [2019-11-15 21:57:53,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 10359 transitions. [2019-11-15 21:57:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:53,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:53,778 INFO L380 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] [2019-11-15 21:57:53,778 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1634343127, now seen corresponding path program 1 times [2019-11-15 21:57:53,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:53,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357406296] [2019-11-15 21:57:53,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:53,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:53,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:53,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357406296] [2019-11-15 21:57:53,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:53,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:53,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020552715] [2019-11-15 21:57:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:53,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:53,888 INFO L87 Difference]: Start difference. First operand 4370 states and 10359 transitions. Second operand 6 states. [2019-11-15 21:57:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:54,389 INFO L93 Difference]: Finished difference Result 4907 states and 11423 transitions. [2019-11-15 21:57:54,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:54,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-11-15 21:57:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:54,396 INFO L225 Difference]: With dead ends: 4907 [2019-11-15 21:57:54,396 INFO L226 Difference]: Without dead ends: 4839 [2019-11-15 21:57:54,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2019-11-15 21:57:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 4403. [2019-11-15 21:57:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4403 states. [2019-11-15 21:57:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4403 states to 4403 states and 10393 transitions. [2019-11-15 21:57:54,473 INFO L78 Accepts]: Start accepts. Automaton has 4403 states and 10393 transitions. Word has length 92 [2019-11-15 21:57:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:54,474 INFO L462 AbstractCegarLoop]: Abstraction has 4403 states and 10393 transitions. [2019-11-15 21:57:54,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4403 states and 10393 transitions. [2019-11-15 21:57:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:54,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:54,480 INFO L380 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] [2019-11-15 21:57:54,480 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash -66397352, now seen corresponding path program 1 times [2019-11-15 21:57:54,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:54,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704017676] [2019-11-15 21:57:54,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:54,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:54,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:54,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704017676] [2019-11-15 21:57:54,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:54,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:57:54,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241821202] [2019-11-15 21:57:54,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:57:54,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:57:54,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:54,615 INFO L87 Difference]: Start difference. First operand 4403 states and 10393 transitions. Second operand 6 states. [2019-11-15 21:57:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:55,012 INFO L93 Difference]: Finished difference Result 5173 states and 12076 transitions. [2019-11-15 21:57:55,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:57:55,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-11-15 21:57:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:55,019 INFO L225 Difference]: With dead ends: 5173 [2019-11-15 21:57:55,020 INFO L226 Difference]: Without dead ends: 5173 [2019-11-15 21:57:55,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:57:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2019-11-15 21:57:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 4341. [2019-11-15 21:57:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4341 states. [2019-11-15 21:57:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 10249 transitions. [2019-11-15 21:57:55,092 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 10249 transitions. Word has length 92 [2019-11-15 21:57:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:55,092 INFO L462 AbstractCegarLoop]: Abstraction has 4341 states and 10249 transitions. [2019-11-15 21:57:55,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:57:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 10249 transitions. [2019-11-15 21:57:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:55,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:55,099 INFO L380 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] [2019-11-15 21:57:55,099 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1489381622, now seen corresponding path program 1 times [2019-11-15 21:57:55,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:55,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252605050] [2019-11-15 21:57:55,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:55,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:55,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:55,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252605050] [2019-11-15 21:57:55,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:55,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:55,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36989397] [2019-11-15 21:57:55,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:55,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:55,237 INFO L87 Difference]: Start difference. First operand 4341 states and 10249 transitions. Second operand 7 states. [2019-11-15 21:57:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:56,120 INFO L93 Difference]: Finished difference Result 6257 states and 14615 transitions. [2019-11-15 21:57:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:57:56,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-11-15 21:57:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:56,129 INFO L225 Difference]: With dead ends: 6257 [2019-11-15 21:57:56,129 INFO L226 Difference]: Without dead ends: 6125 [2019-11-15 21:57:56,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:57:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6125 states. [2019-11-15 21:57:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6125 to 4560. [2019-11-15 21:57:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4560 states. [2019-11-15 21:57:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 10713 transitions. [2019-11-15 21:57:56,216 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 10713 transitions. Word has length 92 [2019-11-15 21:57:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 4560 states and 10713 transitions. [2019-11-15 21:57:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 10713 transitions. [2019-11-15 21:57:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:57:56,225 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:56,225 INFO L380 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] [2019-11-15 21:57:56,226 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash -211358857, now seen corresponding path program 1 times [2019-11-15 21:57:56,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:56,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320885727] [2019-11-15 21:57:56,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:56,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320885727] [2019-11-15 21:57:56,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:56,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:56,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662839956] [2019-11-15 21:57:56,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:56,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:56,362 INFO L87 Difference]: Start difference. First operand 4560 states and 10713 transitions. Second operand 5 states. [2019-11-15 21:57:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:56,535 INFO L93 Difference]: Finished difference Result 2846 states and 6818 transitions. [2019-11-15 21:57:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:57:56,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-15 21:57:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:56,540 INFO L225 Difference]: With dead ends: 2846 [2019-11-15 21:57:56,540 INFO L226 Difference]: Without dead ends: 2819 [2019-11-15 21:57:56,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2019-11-15 21:57:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2672. [2019-11-15 21:57:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2672 states. [2019-11-15 21:57:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 6461 transitions. [2019-11-15 21:57:56,581 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 6461 transitions. Word has length 92 [2019-11-15 21:57:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:56,581 INFO L462 AbstractCegarLoop]: Abstraction has 2672 states and 6461 transitions. [2019-11-15 21:57:56,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 6461 transitions. [2019-11-15 21:57:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:56,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:56,585 INFO L380 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] [2019-11-15 21:57:56,586 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:56,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2071181771, now seen corresponding path program 1 times [2019-11-15 21:57:56,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:56,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846241506] [2019-11-15 21:57:56,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:56,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846241506] [2019-11-15 21:57:56,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:56,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:56,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866858851] [2019-11-15 21:57:56,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:56,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:56,680 INFO L87 Difference]: Start difference. First operand 2672 states and 6461 transitions. Second operand 5 states. [2019-11-15 21:57:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:57,188 INFO L93 Difference]: Finished difference Result 4448 states and 10672 transitions. [2019-11-15 21:57:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:57:57,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 21:57:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:57,194 INFO L225 Difference]: With dead ends: 4448 [2019-11-15 21:57:57,194 INFO L226 Difference]: Without dead ends: 4448 [2019-11-15 21:57:57,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-15 21:57:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 2856. [2019-11-15 21:57:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-11-15 21:57:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 6995 transitions. [2019-11-15 21:57:57,235 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 6995 transitions. Word has length 94 [2019-11-15 21:57:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:57,235 INFO L462 AbstractCegarLoop]: Abstraction has 2856 states and 6995 transitions. [2019-11-15 21:57:57,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 6995 transitions. [2019-11-15 21:57:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:57,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:57,239 INFO L380 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] [2019-11-15 21:57:57,239 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1262171508, now seen corresponding path program 1 times [2019-11-15 21:57:57,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:57,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109380405] [2019-11-15 21:57:57,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:57,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109380405] [2019-11-15 21:57:57,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:57,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:57,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995977166] [2019-11-15 21:57:57,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:57,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:57,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:57,331 INFO L87 Difference]: Start difference. First operand 2856 states and 6995 transitions. Second operand 5 states. [2019-11-15 21:57:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:57,629 INFO L93 Difference]: Finished difference Result 3307 states and 8000 transitions. [2019-11-15 21:57:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:57:57,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 21:57:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:57,635 INFO L225 Difference]: With dead ends: 3307 [2019-11-15 21:57:57,635 INFO L226 Difference]: Without dead ends: 3307 [2019-11-15 21:57:57,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2019-11-15 21:57:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 2862. [2019-11-15 21:57:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2862 states. [2019-11-15 21:57:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 7010 transitions. [2019-11-15 21:57:57,673 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 7010 transitions. Word has length 94 [2019-11-15 21:57:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:57,674 INFO L462 AbstractCegarLoop]: Abstraction has 2862 states and 7010 transitions. [2019-11-15 21:57:57,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 7010 transitions. [2019-11-15 21:57:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:57,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:57,678 INFO L380 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] [2019-11-15 21:57:57,678 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:57,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2110112205, now seen corresponding path program 1 times [2019-11-15 21:57:57,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:57,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820156213] [2019-11-15 21:57:57,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:57,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820156213] [2019-11-15 21:57:57,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:57,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:57:57,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353077148] [2019-11-15 21:57:57,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:57,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:57,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:57,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:57,844 INFO L87 Difference]: Start difference. First operand 2862 states and 7010 transitions. Second operand 8 states. [2019-11-15 21:57:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:58,441 INFO L93 Difference]: Finished difference Result 4245 states and 10170 transitions. [2019-11-15 21:57:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:57:58,442 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-15 21:57:58,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:58,447 INFO L225 Difference]: With dead ends: 4245 [2019-11-15 21:57:58,448 INFO L226 Difference]: Without dead ends: 4227 [2019-11-15 21:57:58,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:57:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2019-11-15 21:57:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 3125. [2019-11-15 21:57:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2019-11-15 21:57:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 7623 transitions. [2019-11-15 21:57:58,493 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 7623 transitions. Word has length 94 [2019-11-15 21:57:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:58,493 INFO L462 AbstractCegarLoop]: Abstraction has 3125 states and 7623 transitions. [2019-11-15 21:57:58,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 7623 transitions. [2019-11-15 21:57:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:58,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:58,496 INFO L380 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] [2019-11-15 21:57:58,496 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -940090610, now seen corresponding path program 1 times [2019-11-15 21:57:58,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:58,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829371083] [2019-11-15 21:57:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:58,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829371083] [2019-11-15 21:57:58,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:58,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:58,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603253022] [2019-11-15 21:57:58,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:58,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:58,700 INFO L87 Difference]: Start difference. First operand 3125 states and 7623 transitions. Second operand 7 states. [2019-11-15 21:57:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:58,975 INFO L93 Difference]: Finished difference Result 3476 states and 8286 transitions. [2019-11-15 21:57:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:58,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 21:57:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:58,979 INFO L225 Difference]: With dead ends: 3476 [2019-11-15 21:57:58,979 INFO L226 Difference]: Without dead ends: 3476 [2019-11-15 21:57:58,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:57:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2019-11-15 21:57:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3163. [2019-11-15 21:57:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3163 states. [2019-11-15 21:57:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 7647 transitions. [2019-11-15 21:57:59,018 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 7647 transitions. Word has length 94 [2019-11-15 21:57:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:59,018 INFO L462 AbstractCegarLoop]: Abstraction has 3163 states and 7647 transitions. [2019-11-15 21:57:59,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 7647 transitions. [2019-11-15 21:57:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:59,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:59,021 INFO L380 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] [2019-11-15 21:57:59,022 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -610324849, now seen corresponding path program 1 times [2019-11-15 21:57:59,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:59,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846871276] [2019-11-15 21:57:59,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:59,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846871276] [2019-11-15 21:57:59,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:59,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:57:59,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997857126] [2019-11-15 21:57:59,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:59,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:59,255 INFO L87 Difference]: Start difference. First operand 3163 states and 7647 transitions. Second operand 8 states. [2019-11-15 21:57:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:59,550 INFO L93 Difference]: Finished difference Result 2817 states and 6749 transitions. [2019-11-15 21:57:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:57:59,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-15 21:57:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:59,553 INFO L225 Difference]: With dead ends: 2817 [2019-11-15 21:57:59,553 INFO L226 Difference]: Without dead ends: 2749 [2019-11-15 21:57:59,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:57:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-11-15 21:57:59,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2658. [2019-11-15 21:57:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-11-15 21:57:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 6451 transitions. [2019-11-15 21:57:59,583 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 6451 transitions. Word has length 94 [2019-11-15 21:57:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:59,584 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 6451 transitions. [2019-11-15 21:57:59,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 6451 transitions. [2019-11-15 21:57:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:59,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:59,586 INFO L380 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] [2019-11-15 21:57:59,586 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1196522800, now seen corresponding path program 1 times [2019-11-15 21:57:59,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:59,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848495646] [2019-11-15 21:57:59,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:57:59,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848495646] [2019-11-15 21:57:59,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:59,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:57:59,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174375247] [2019-11-15 21:57:59,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:57:59,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:57:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:57:59,710 INFO L87 Difference]: Start difference. First operand 2658 states and 6451 transitions. Second operand 5 states. [2019-11-15 21:57:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:59,938 INFO L93 Difference]: Finished difference Result 2775 states and 6670 transitions. [2019-11-15 21:57:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:57:59,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 21:57:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:59,942 INFO L225 Difference]: With dead ends: 2775 [2019-11-15 21:57:59,943 INFO L226 Difference]: Without dead ends: 2757 [2019-11-15 21:57:59,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-11-15 21:57:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2392. [2019-11-15 21:57:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-11-15 21:57:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 5777 transitions. [2019-11-15 21:57:59,975 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 5777 transitions. Word has length 94 [2019-11-15 21:57:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:59,975 INFO L462 AbstractCegarLoop]: Abstraction has 2392 states and 5777 transitions. [2019-11-15 21:57:59,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:57:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 5777 transitions. [2019-11-15 21:57:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:57:59,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:59,982 INFO L380 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] [2019-11-15 21:57:59,983 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:57:59,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash 48241681, now seen corresponding path program 1 times [2019-11-15 21:57:59,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:59,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253030707] [2019-11-15 21:57:59,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:00,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253030707] [2019-11-15 21:58:00,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:00,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 21:58:00,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243581856] [2019-11-15 21:58:00,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:58:00,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:58:00,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:00,284 INFO L87 Difference]: Start difference. First operand 2392 states and 5777 transitions. Second operand 12 states. [2019-11-15 21:58:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:00,662 INFO L93 Difference]: Finished difference Result 3822 states and 9363 transitions. [2019-11-15 21:58:00,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:58:00,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-15 21:58:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:00,667 INFO L225 Difference]: With dead ends: 3822 [2019-11-15 21:58:00,668 INFO L226 Difference]: Without dead ends: 2922 [2019-11-15 21:58:00,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:58:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-11-15 21:58:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2810. [2019-11-15 21:58:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-11-15 21:58:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6714 transitions. [2019-11-15 21:58:00,720 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6714 transitions. Word has length 94 [2019-11-15 21:58:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6714 transitions. [2019-11-15 21:58:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:58:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6714 transitions. [2019-11-15 21:58:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:58:00,724 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:00,725 INFO L380 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] [2019-11-15 21:58:00,725 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash -169960121, now seen corresponding path program 2 times [2019-11-15 21:58:00,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:00,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819610513] [2019-11-15 21:58:00,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:00,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:00,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:58:00,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819610513] [2019-11-15 21:58:00,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:00,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:58:00,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29021141] [2019-11-15 21:58:00,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:58:00,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:00,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:58:00,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:58:00,921 INFO L87 Difference]: Start difference. First operand 2810 states and 6714 transitions. Second operand 8 states. [2019-11-15 21:58:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:01,109 INFO L93 Difference]: Finished difference Result 4836 states and 11664 transitions. [2019-11-15 21:58:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:01,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-15 21:58:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:01,113 INFO L225 Difference]: With dead ends: 4836 [2019-11-15 21:58:01,113 INFO L226 Difference]: Without dead ends: 2253 [2019-11-15 21:58:01,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-11-15 21:58:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2213. [2019-11-15 21:58:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-11-15 21:58:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5313 transitions. [2019-11-15 21:58:01,153 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5313 transitions. Word has length 94 [2019-11-15 21:58:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:01,154 INFO L462 AbstractCegarLoop]: Abstraction has 2213 states and 5313 transitions. [2019-11-15 21:58:01,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:58:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5313 transitions. [2019-11-15 21:58:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:58:01,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:01,158 INFO L380 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] [2019-11-15 21:58:01,158 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:58:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash 654613161, now seen corresponding path program 3 times [2019-11-15 21:58:01,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:01,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016933253] [2019-11-15 21:58:01,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:01,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:01,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:58:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:58:01,299 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:58:01,299 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:58:01,562 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:58:01,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:58:01 BasicIcfg [2019-11-15 21:58:01,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:58:01,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:58:01,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:58:01,567 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:58:01,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:57:07" (3/4) ... [2019-11-15 21:58:01,584 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:58:01,730 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f30896f0-da55-4147-a855-16ea1b33cd12/bin/uautomizer/witness.graphml [2019-11-15 21:58:01,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:58:01,733 INFO L168 Benchmark]: Toolchain (without parser) took 55978.04 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 944.7 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 318.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,733 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:58:01,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.04 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,734 INFO L168 Benchmark]: Boogie Preprocessor took 47.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:58:01,735 INFO L168 Benchmark]: RCFGBuilder took 1108.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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,735 INFO L168 Benchmark]: TraceAbstraction took 53702.66 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,736 INFO L168 Benchmark]: Witness Printer took 163.32 ms. Allocated memory is still 4.7 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:01,738 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 871.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.04 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1108.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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53702.66 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 163.32 ms. Allocated memory is still 4.7 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 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: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L778] 0 pthread_t t2015; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L779] FCALL, FORK 0 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L780] 0 pthread_t t2016; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L781] FCALL, FORK 0 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L738] 1 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 [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 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=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 175 locations, 3 error locations. Result: UNSAFE, OverallTime: 53.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7938 SDtfs, 8809 SDslu, 21249 SDs, 0 SdLazy, 9467 SolverSat, 637 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 95 SyntacticMatches, 12 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66329occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 119202 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2673 NumberOfCodeBlocks, 2673 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2546 ConstructedInterpolants, 0 QuantifiedInterpolants, 595699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...