java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:58:04,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:58:04,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:58:04,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:58:04,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:58:04,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:58:04,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:58:04,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:58:04,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:58:04,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:58:04,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:58:04,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:58:04,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:58:04,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:58:04,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:58:04,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:58:04,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:58:04,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:58:04,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:58:04,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:58:04,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:58:04,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:58:04,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:58:04,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:58:04,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:58:04,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:58:04,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:58:04,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:58:04,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:58:04,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:58:04,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:58:04,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:58:04,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:58:04,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:58:04,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:58:04,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:58:04,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:58:04,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:58:04,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:58:04,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:58:04,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:58:04,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:58:04,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:58:04,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:58:04,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:58:04,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:58:04,717 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:58:04,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:58:04,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:58:04,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:58:04,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:58:04,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:58:04,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:58:04,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:58:04,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:58:04,721 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:58:04,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:58:04,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:58:04,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:58:04,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:58:04,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:58:04,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:58:04,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:58:04,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:58:04,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:58:04,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:58:04,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:58:04,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:58:04,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:58:04,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:58:04,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:58:04,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:58:04,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:58:04,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:58:04,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:58:04,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:58:04,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label53.c [2019-09-07 19:58:04,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85061e0c/18290ed406ac4192bad4ca3682c27959/FLAG979027821 [2019-09-07 19:58:05,606 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:58:05,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label53.c [2019-09-07 19:58:05,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85061e0c/18290ed406ac4192bad4ca3682c27959/FLAG979027821 [2019-09-07 19:58:05,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85061e0c/18290ed406ac4192bad4ca3682c27959 [2019-09-07 19:58:05,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:58:05,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:58:05,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:58:05,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:58:05,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:58:05,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:58:05" (1/1) ... [2019-09-07 19:58:05,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbe1c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:05, skipping insertion in model container [2019-09-07 19:58:05,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:58:05" (1/1) ... [2019-09-07 19:58:05,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:58:05,898 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:58:07,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:58:07,512 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:58:08,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:58:08,307 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:58:08,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08 WrapperNode [2019-09-07 19:58:08,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:58:08,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:58:08,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:58:08,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:58:08,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... [2019-09-07 19:58:08,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:58:08,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:58:08,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:58:08,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:58:08,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-07 19:58:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:58:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:58:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:58:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:58:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:58:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:58:08,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:58:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:58:08,690 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:58:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:58:08,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:58:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:58:15,616 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:58:15,617 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:58:15,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:58:15 BoogieIcfgContainer [2019-09-07 19:58:15,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:58:15,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:58:15,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:58:15,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:58:15,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:58:05" (1/3) ... [2019-09-07 19:58:15,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:58:15, skipping insertion in model container [2019-09-07 19:58:15,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:58:08" (2/3) ... [2019-09-07 19:58:15,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473ed373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:58:15, skipping insertion in model container [2019-09-07 19:58:15,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:58:15" (3/3) ... [2019-09-07 19:58:15,635 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label53.c [2019-09-07 19:58:15,646 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:58:15,654 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:58:15,672 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:58:15,710 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:58:15,711 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:58:15,711 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:58:15,711 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:58:15,711 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:58:15,712 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:58:15,712 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:58:15,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:58:15,712 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:58:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:58:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 19:58:15,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:15,768 INFO L399 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] [2019-09-07 19:58:15,770 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:15,776 INFO L82 PathProgramCache]: Analyzing trace with hash -592016848, now seen corresponding path program 1 times [2019-09-07 19:58:15,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:15,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:15,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:58:16,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:58:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:58:16,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:58:16,142 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:58:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:22,016 INFO L93 Difference]: Finished difference Result 3090 states and 5712 transitions. [2019-09-07 19:58:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:58:22,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 19:58:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:22,074 INFO L225 Difference]: With dead ends: 3090 [2019-09-07 19:58:22,074 INFO L226 Difference]: Without dead ends: 1909 [2019-09-07 19:58:22,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:58:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-09-07 19:58:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1895. [2019-09-07 19:58:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 19:58:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 3364 transitions. [2019-09-07 19:58:22,258 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 3364 transitions. Word has length 37 [2019-09-07 19:58:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:22,259 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 3364 transitions. [2019-09-07 19:58:22,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:58:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 3364 transitions. [2019-09-07 19:58:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 19:58:22,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:22,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:58:22,267 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash -32383083, now seen corresponding path program 1 times [2019-09-07 19:58:22,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:22,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:22,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:22,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:22,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:22,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:22,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:22,505 INFO L87 Difference]: Start difference. First operand 1895 states and 3364 transitions. Second operand 6 states. [2019-09-07 19:58:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:33,281 INFO L93 Difference]: Finished difference Result 5499 states and 9901 transitions. [2019-09-07 19:58:33,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:33,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-07 19:58:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:33,318 INFO L225 Difference]: With dead ends: 5499 [2019-09-07 19:58:33,318 INFO L226 Difference]: Without dead ends: 3610 [2019-09-07 19:58:33,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:58:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2019-09-07 19:58:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3579. [2019-09-07 19:58:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3579 states. [2019-09-07 19:58:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 5705 transitions. [2019-09-07 19:58:33,445 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 5705 transitions. Word has length 119 [2019-09-07 19:58:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:33,448 INFO L475 AbstractCegarLoop]: Abstraction has 3579 states and 5705 transitions. [2019-09-07 19:58:33,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 5705 transitions. [2019-09-07 19:58:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 19:58:33,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:33,484 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:58:33,484 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1518489925, now seen corresponding path program 1 times [2019-09-07 19:58:33,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:33,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:33,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:33,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:33,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:33,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:58:33,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:58:33,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:58:33,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:58:33,687 INFO L87 Difference]: Start difference. First operand 3579 states and 5705 transitions. Second operand 5 states. [2019-09-07 19:58:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:41,926 INFO L93 Difference]: Finished difference Result 10802 states and 17698 transitions. [2019-09-07 19:58:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:58:41,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-07 19:58:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:41,978 INFO L225 Difference]: With dead ends: 10802 [2019-09-07 19:58:41,981 INFO L226 Difference]: Without dead ends: 7229 [2019-09-07 19:58:41,996 INFO L628 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-09-07 19:58:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2019-09-07 19:58:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 7042. [2019-09-07 19:58:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-09-07 19:58:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 10398 transitions. [2019-09-07 19:58:42,333 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 10398 transitions. Word has length 135 [2019-09-07 19:58:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:42,334 INFO L475 AbstractCegarLoop]: Abstraction has 7042 states and 10398 transitions. [2019-09-07 19:58:42,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:58:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 10398 transitions. [2019-09-07 19:58:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 19:58:42,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:42,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:58:42,338 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1655732315, now seen corresponding path program 1 times [2019-09-07 19:58:42,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:42,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:42,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:42,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:42,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:42,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:42,554 INFO L87 Difference]: Start difference. First operand 7042 states and 10398 transitions. Second operand 6 states. [2019-09-07 19:58:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:49,435 INFO L93 Difference]: Finished difference Result 17954 states and 27673 transitions. [2019-09-07 19:58:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:49,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-07 19:58:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:49,488 INFO L225 Difference]: With dead ends: 17954 [2019-09-07 19:58:49,488 INFO L226 Difference]: Without dead ends: 10918 [2019-09-07 19:58:49,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:58:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10918 states. [2019-09-07 19:58:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10918 to 10727. [2019-09-07 19:58:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-09-07 19:58:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 15561 transitions. [2019-09-07 19:58:49,804 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 15561 transitions. Word has length 172 [2019-09-07 19:58:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:49,806 INFO L475 AbstractCegarLoop]: Abstraction has 10727 states and 15561 transitions. [2019-09-07 19:58:49,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 15561 transitions. [2019-09-07 19:58:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 19:58:49,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:49,816 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:58:49,817 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1148283996, now seen corresponding path program 1 times [2019-09-07 19:58:49,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:49,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:50,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:50,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:50,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:50,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:50,181 INFO L87 Difference]: Start difference. First operand 10727 states and 15561 transitions. Second operand 6 states. [2019-09-07 19:59:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:01,616 INFO L93 Difference]: Finished difference Result 37009 states and 59700 transitions. [2019-09-07 19:59:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:59:01,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-09-07 19:59:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:01,735 INFO L225 Difference]: With dead ends: 37009 [2019-09-07 19:59:01,735 INFO L226 Difference]: Without dead ends: 26288 [2019-09-07 19:59:01,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:59:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26288 states. [2019-09-07 19:59:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26288 to 26083. [2019-09-07 19:59:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26083 states. [2019-09-07 19:59:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 38089 transitions. [2019-09-07 19:59:02,494 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 38089 transitions. Word has length 194 [2019-09-07 19:59:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:02,495 INFO L475 AbstractCegarLoop]: Abstraction has 26083 states and 38089 transitions. [2019-09-07 19:59:02,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:59:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 38089 transitions. [2019-09-07 19:59:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-07 19:59:02,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:02,502 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:59:02,502 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:02,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash 410705274, now seen corresponding path program 1 times [2019-09-07 19:59:02,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:02,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:02,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:59:02,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:59:02,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:59:02,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:59:02,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:59:02,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:59:02,750 INFO L87 Difference]: Start difference. First operand 26083 states and 38089 transitions. Second operand 6 states. [2019-09-07 19:59:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:09,882 INFO L93 Difference]: Finished difference Result 61279 states and 96173 transitions. [2019-09-07 19:59:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:59:09,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-07 19:59:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:10,023 INFO L225 Difference]: With dead ends: 61279 [2019-09-07 19:59:10,024 INFO L226 Difference]: Without dead ends: 35202 [2019-09-07 19:59:10,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:59:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35202 states. [2019-09-07 19:59:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35202 to 34937. [2019-09-07 19:59:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34937 states. [2019-09-07 19:59:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34937 states to 34937 states and 50675 transitions. [2019-09-07 19:59:10,912 INFO L78 Accepts]: Start accepts. Automaton has 34937 states and 50675 transitions. Word has length 217 [2019-09-07 19:59:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:10,912 INFO L475 AbstractCegarLoop]: Abstraction has 34937 states and 50675 transitions. [2019-09-07 19:59:10,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:59:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 34937 states and 50675 transitions. [2019-09-07 19:59:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 19:59:10,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:10,918 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:59:10,919 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash 692874918, now seen corresponding path program 1 times [2019-09-07 19:59:10,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:10,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:10,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 60 proven. 94 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:59:11,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:11,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:11,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:11,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:59:11,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 19:59:11,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:59:11,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:59:11,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:59:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:59:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:59:11,387 INFO L87 Difference]: Start difference. First operand 34937 states and 50675 transitions. Second operand 8 states. [2019-09-07 19:59:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:32,438 INFO L93 Difference]: Finished difference Result 116040 states and 187356 transitions. [2019-09-07 19:59:32,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 19:59:32,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-07 19:59:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:32,864 INFO L225 Difference]: With dead ends: 116040 [2019-09-07 19:59:32,864 INFO L226 Difference]: Without dead ends: 81109 [2019-09-07 19:59:32,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 19:59:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81109 states. [2019-09-07 19:59:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81109 to 80838. [2019-09-07 19:59:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80838 states. [2019-09-07 19:59:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80838 states to 80838 states and 124218 transitions. [2019-09-07 19:59:37,852 INFO L78 Accepts]: Start accepts. Automaton has 80838 states and 124218 transitions. Word has length 240 [2019-09-07 19:59:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:37,852 INFO L475 AbstractCegarLoop]: Abstraction has 80838 states and 124218 transitions. [2019-09-07 19:59:37,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:59:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 80838 states and 124218 transitions. [2019-09-07 19:59:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-07 19:59:37,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:37,858 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:59:37,859 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:37,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -684196860, now seen corresponding path program 1 times [2019-09-07 19:59:37,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:59:40,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:40,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:40,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:59:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:59:40,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:59:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 19:59:40,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:59:40,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:59:40,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:59:40,507 INFO L87 Difference]: Start difference. First operand 80838 states and 124218 transitions. Second operand 12 states. [2019-09-07 19:59:55,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:55,988 INFO L93 Difference]: Finished difference Result 176916 states and 275397 transitions. [2019-09-07 19:59:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:59:55,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 246 [2019-09-07 19:59:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:56,324 INFO L225 Difference]: With dead ends: 176916 [2019-09-07 19:59:56,324 INFO L226 Difference]: Without dead ends: 96887 [2019-09-07 19:59:56,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-09-07 19:59:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96887 states. [2019-09-07 19:59:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96887 to 91637. [2019-09-07 19:59:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91637 states. [2019-09-07 19:59:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91637 states to 91637 states and 126016 transitions. [2019-09-07 19:59:58,897 INFO L78 Accepts]: Start accepts. Automaton has 91637 states and 126016 transitions. Word has length 246 [2019-09-07 19:59:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:58,899 INFO L475 AbstractCegarLoop]: Abstraction has 91637 states and 126016 transitions. [2019-09-07 19:59:58,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:59:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 91637 states and 126016 transitions. [2019-09-07 19:59:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-07 19:59:58,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:58,922 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:59:58,923 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:58,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash 309464452, now seen corresponding path program 1 times [2019-09-07 19:59:58,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 23 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 19:59:59,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:59,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:59:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:59,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:59:59,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 187 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:59:59,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:59:59,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:59:59,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:59:59,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:59:59,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:59:59,631 INFO L87 Difference]: Start difference. First operand 91637 states and 126016 transitions. Second operand 9 states. [2019-09-07 20:00:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:09,530 INFO L93 Difference]: Finished difference Result 162925 states and 232601 transitions. [2019-09-07 20:00:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:00:09,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 323 [2019-09-07 20:00:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:09,918 INFO L225 Difference]: With dead ends: 162925 [2019-09-07 20:00:09,918 INFO L226 Difference]: Without dead ends: 83534 [2019-09-07 20:00:10,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 324 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:00:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83534 states. [2019-09-07 20:00:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83534 to 79308. [2019-09-07 20:00:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79308 states. [2019-09-07 20:00:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79308 states to 79308 states and 102213 transitions. [2019-09-07 20:00:11,604 INFO L78 Accepts]: Start accepts. Automaton has 79308 states and 102213 transitions. Word has length 323 [2019-09-07 20:00:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:11,605 INFO L475 AbstractCegarLoop]: Abstraction has 79308 states and 102213 transitions. [2019-09-07 20:00:11,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:00:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79308 states and 102213 transitions. [2019-09-07 20:00:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-07 20:00:11,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:11,623 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:00:11,623 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:11,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1023598526, now seen corresponding path program 1 times [2019-09-07 20:00:11,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:11,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:11,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:11,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:11,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 176 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:00:12,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:12,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:00:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:00:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:12,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:00:12,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:00:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:00:12,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-09-07 20:00:12,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:00:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:00:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:00:12,645 INFO L87 Difference]: Start difference. First operand 79308 states and 102213 transitions. Second operand 7 states. [2019-09-07 20:00:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:23,944 INFO L93 Difference]: Finished difference Result 163330 states and 212606 transitions. [2019-09-07 20:00:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:00:23,945 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 366 [2019-09-07 20:00:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:24,174 INFO L225 Difference]: With dead ends: 163330 [2019-09-07 20:00:24,174 INFO L226 Difference]: Without dead ends: 95355 [2019-09-07 20:00:24,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:00:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95355 states. [2019-09-07 20:00:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95355 to 85538. [2019-09-07 20:00:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85538 states. [2019-09-07 20:00:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85538 states to 85538 states and 108624 transitions. [2019-09-07 20:00:26,215 INFO L78 Accepts]: Start accepts. Automaton has 85538 states and 108624 transitions. Word has length 366 [2019-09-07 20:00:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:26,216 INFO L475 AbstractCegarLoop]: Abstraction has 85538 states and 108624 transitions. [2019-09-07 20:00:26,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:00:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 85538 states and 108624 transitions. [2019-09-07 20:00:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-07 20:00:26,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:26,251 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:00:26,252 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -700057423, now seen corresponding path program 1 times [2019-09-07 20:00:26,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:26,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:26,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 20:00:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:00:26,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:00:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:00:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:00:26,604 INFO L87 Difference]: Start difference. First operand 85538 states and 108624 transitions. Second operand 4 states. [2019-09-07 20:00:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:36,820 INFO L93 Difference]: Finished difference Result 223358 states and 292793 transitions. [2019-09-07 20:00:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:00:36,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 442 [2019-09-07 20:00:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:37,114 INFO L225 Difference]: With dead ends: 223358 [2019-09-07 20:00:37,115 INFO L226 Difference]: Without dead ends: 138629 [2019-09-07 20:00:37,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:00:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138629 states. [2019-09-07 20:00:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138629 to 127237. [2019-09-07 20:00:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127237 states. [2019-09-07 20:00:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127237 states to 127237 states and 163074 transitions. [2019-09-07 20:00:39,252 INFO L78 Accepts]: Start accepts. Automaton has 127237 states and 163074 transitions. Word has length 442 [2019-09-07 20:00:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:39,253 INFO L475 AbstractCegarLoop]: Abstraction has 127237 states and 163074 transitions. [2019-09-07 20:00:39,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:00:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 127237 states and 163074 transitions. [2019-09-07 20:00:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-07 20:00:39,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:39,276 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:00:39,277 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash 888364300, now seen corresponding path program 1 times [2019-09-07 20:00:39,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:39,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 217 proven. 58 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-07 20:00:39,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:39,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:00:39,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:39,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:00:39,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-09-07 20:00:40,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:00:40,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 20:00:40,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:00:40,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:00:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:00:40,626 INFO L87 Difference]: Start difference. First operand 127237 states and 163074 transitions. Second operand 6 states. [2019-09-07 20:00:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:51,255 INFO L93 Difference]: Finished difference Result 393837 states and 525670 transitions. [2019-09-07 20:00:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:00:51,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 495 [2019-09-07 20:00:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:51,921 INFO L225 Difference]: With dead ends: 393837 [2019-09-07 20:00:51,921 INFO L226 Difference]: Without dead ends: 267409 [2019-09-07 20:00:52,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:00:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267409 states. [2019-09-07 20:00:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267409 to 255591. [2019-09-07 20:00:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255591 states. [2019-09-07 20:01:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255591 states to 255591 states and 318367 transitions. [2019-09-07 20:01:03,040 INFO L78 Accepts]: Start accepts. Automaton has 255591 states and 318367 transitions. Word has length 495 [2019-09-07 20:01:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:03,041 INFO L475 AbstractCegarLoop]: Abstraction has 255591 states and 318367 transitions. [2019-09-07 20:01:03,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:01:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 255591 states and 318367 transitions. [2019-09-07 20:01:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-09-07 20:01:03,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:03,072 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:01:03,072 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1893423248, now seen corresponding path program 1 times [2019-09-07 20:01:03,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 460 proven. 2 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 20:01:03,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:03,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:01:03,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:03,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:01:03,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 460 proven. 2 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 20:01:04,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:01:04,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:01:04,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:01:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:01:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:04,570 INFO L87 Difference]: Start difference. First operand 255591 states and 318367 transitions. Second operand 9 states. [2019-09-07 20:01:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:26,295 INFO L93 Difference]: Finished difference Result 565779 states and 744596 transitions. [2019-09-07 20:01:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:01:26,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 527 [2019-09-07 20:01:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:27,200 INFO L225 Difference]: With dead ends: 565779 [2019-09-07 20:01:27,201 INFO L226 Difference]: Without dead ends: 301115 [2019-09-07 20:01:28,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:01:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301115 states. [2019-09-07 20:01:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301115 to 297284. [2019-09-07 20:01:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297284 states. [2019-09-07 20:01:39,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297284 states to 297284 states and 372511 transitions. [2019-09-07 20:01:39,733 INFO L78 Accepts]: Start accepts. Automaton has 297284 states and 372511 transitions. Word has length 527 [2019-09-07 20:01:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:39,734 INFO L475 AbstractCegarLoop]: Abstraction has 297284 states and 372511 transitions. [2019-09-07 20:01:39,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:01:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 297284 states and 372511 transitions. [2019-09-07 20:01:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-09-07 20:01:39,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:39,768 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:01:39,768 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1778508016, now seen corresponding path program 1 times [2019-09-07 20:01:39,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:39,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 161 proven. 317 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:01:41,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:41,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:01:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:41,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:01:41,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-09-07 20:01:42,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:01:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-07 20:01:42,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:01:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:01:42,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:01:42,015 INFO L87 Difference]: Start difference. First operand 297284 states and 372511 transitions. Second operand 11 states. [2019-09-07 20:02:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:12,837 INFO L93 Difference]: Finished difference Result 645735 states and 820591 transitions. [2019-09-07 20:02:12,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 20:02:12,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 568 [2019-09-07 20:02:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:13,727 INFO L225 Difference]: With dead ends: 645735 [2019-09-07 20:02:13,727 INFO L226 Difference]: Without dead ends: 340738 [2019-09-07 20:02:14,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 596 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 20:02:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340738 states. [2019-09-07 20:02:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340738 to 338410. [2019-09-07 20:02:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338410 states. [2019-09-07 20:02:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338410 states to 338410 states and 404558 transitions. [2019-09-07 20:02:25,028 INFO L78 Accepts]: Start accepts. Automaton has 338410 states and 404558 transitions. Word has length 568 [2019-09-07 20:02:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:25,029 INFO L475 AbstractCegarLoop]: Abstraction has 338410 states and 404558 transitions. [2019-09-07 20:02:25,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:02:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 338410 states and 404558 transitions. [2019-09-07 20:02:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-09-07 20:02:25,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:25,052 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:02:25,053 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1949075782, now seen corresponding path program 1 times [2019-09-07 20:02:25,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:25,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 360 proven. 207 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2019-09-07 20:02:25,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:25,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:02:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:25,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:02:25,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 877 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 20:02:30,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:02:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:02:30,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:02:30,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:02:30,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:02:30,580 INFO L87 Difference]: Start difference. First operand 338410 states and 404558 transitions. Second operand 9 states. [2019-09-07 20:02:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:43,739 INFO L93 Difference]: Finished difference Result 633454 states and 743823 transitions. [2019-09-07 20:02:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:02:43,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 591 [2019-09-07 20:02:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:45,284 INFO L225 Difference]: With dead ends: 633454 [2019-09-07 20:02:45,284 INFO L226 Difference]: Without dead ends: 294169 [2019-09-07 20:02:45,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:02:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294169 states. [2019-09-07 20:02:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294169 to 290939. [2019-09-07 20:02:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290939 states. [2019-09-07 20:02:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290939 states to 290939 states and 318134 transitions. [2019-09-07 20:02:56,198 INFO L78 Accepts]: Start accepts. Automaton has 290939 states and 318134 transitions. Word has length 591 [2019-09-07 20:02:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:56,198 INFO L475 AbstractCegarLoop]: Abstraction has 290939 states and 318134 transitions. [2019-09-07 20:02:56,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:02:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 290939 states and 318134 transitions. [2019-09-07 20:02:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-09-07 20:02:56,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:56,221 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:02:56,221 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 498259764, now seen corresponding path program 1 times [2019-09-07 20:02:56,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 679 proven. 2 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2019-09-07 20:02:56,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:56,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:02:56,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:56,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:02:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:56,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:02:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 829 proven. 2 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-07 20:02:57,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:02:57,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 20:02:57,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:02:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:02:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:02:57,560 INFO L87 Difference]: Start difference. First operand 290939 states and 318134 transitions. Second operand 12 states. [2019-09-07 20:04:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:01,854 INFO L93 Difference]: Finished difference Result 768321 states and 888642 transitions. [2019-09-07 20:04:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-07 20:04:01,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 678 [2019-09-07 20:04:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:03,063 INFO L225 Difference]: With dead ends: 768321 [2019-09-07 20:04:03,064 INFO L226 Difference]: Without dead ends: 469027 [2019-09-07 20:04:03,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6505 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2091, Invalid=13911, Unknown=0, NotChecked=0, Total=16002 [2019-09-07 20:04:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469027 states. [2019-09-07 20:04:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469027 to 446635. [2019-09-07 20:04:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446635 states. [2019-09-07 20:04:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446635 states to 446635 states and 497793 transitions. [2019-09-07 20:04:21,765 INFO L78 Accepts]: Start accepts. Automaton has 446635 states and 497793 transitions. Word has length 678 [2019-09-07 20:04:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 446635 states and 497793 transitions. [2019-09-07 20:04:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:04:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 446635 states and 497793 transitions. [2019-09-07 20:04:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2019-09-07 20:04:21,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:21,777 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:04:21,777 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -791272840, now seen corresponding path program 1 times [2019-09-07 20:04:21,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:21,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 514 proven. 2 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-07 20:04:23,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:23,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:04:23,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:23,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:04:23,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:23,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:04:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 226 proven. 389 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-07 20:04:24,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:24,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 20:04:24,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:04:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:04:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:04:24,443 INFO L87 Difference]: Start difference. First operand 446635 states and 497793 transitions. Second operand 9 states. [2019-09-07 20:04:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:47,583 INFO L93 Difference]: Finished difference Result 953705 states and 1075149 transitions. [2019-09-07 20:04:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 20:04:47,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 743 [2019-09-07 20:04:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:48,766 INFO L225 Difference]: With dead ends: 953705 [2019-09-07 20:04:48,767 INFO L226 Difference]: Without dead ends: 527189 [2019-09-07 20:04:49,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 749 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:04:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527189 states. [2019-09-07 20:04:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527189 to 524729. [2019-09-07 20:04:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524729 states. [2019-09-07 20:05:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524729 states to 524729 states and 582190 transitions. [2019-09-07 20:05:06,611 INFO L78 Accepts]: Start accepts. Automaton has 524729 states and 582190 transitions. Word has length 743 [2019-09-07 20:05:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:06,612 INFO L475 AbstractCegarLoop]: Abstraction has 524729 states and 582190 transitions. [2019-09-07 20:05:06,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:05:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 524729 states and 582190 transitions. [2019-09-07 20:05:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2019-09-07 20:05:06,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:06,643 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:05:06,643 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 845441353, now seen corresponding path program 1 times [2019-09-07 20:05:06,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:06,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:06,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:06,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 598 proven. 2 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 20:05:13,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:05:13,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:05:13,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:13,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:05:13,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:05:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 598 proven. 2 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-09-07 20:05:14,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:05:14,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 20:05:14,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:05:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:05:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:05:14,006 INFO L87 Difference]: Start difference. First operand 524729 states and 582190 transitions. Second operand 7 states. [2019-09-07 20:05:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:32,186 INFO L93 Difference]: Finished difference Result 1080888 states and 1204449 transitions. [2019-09-07 20:05:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:05:32,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 898 [2019-09-07 20:05:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:33,494 INFO L225 Difference]: With dead ends: 1080888 [2019-09-07 20:05:33,494 INFO L226 Difference]: Without dead ends: 585307 [2019-09-07 20:05:34,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 904 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:05:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585307 states. [2019-09-07 20:05:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585307 to 575422. [2019-09-07 20:05:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575422 states. [2019-09-07 20:05:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575422 states to 575422 states and 632983 transitions. [2019-09-07 20:05:53,054 INFO L78 Accepts]: Start accepts. Automaton has 575422 states and 632983 transitions. Word has length 898 [2019-09-07 20:05:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:53,055 INFO L475 AbstractCegarLoop]: Abstraction has 575422 states and 632983 transitions. [2019-09-07 20:05:53,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:05:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 575422 states and 632983 transitions. [2019-09-07 20:05:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2019-09-07 20:05:53,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:53,236 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:05:53,236 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:53,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1395070695, now seen corresponding path program 1 times [2019-09-07 20:05:53,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:53,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:53,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:53,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 547 proven. 89 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2019-09-07 20:06:01,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:01,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:01,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:06:01,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2052 backedges. 1379 proven. 2 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2019-09-07 20:06:02,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:02,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:06:02,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:06:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:06:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:06:02,753 INFO L87 Difference]: Start difference. First operand 575422 states and 632983 transitions. Second operand 9 states. [2019-09-07 20:06:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:27,677 INFO L93 Difference]: Finished difference Result 1145754 states and 1272099 transitions. [2019-09-07 20:06:27,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 20:06:27,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1464 [2019-09-07 20:06:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:29,054 INFO L225 Difference]: With dead ends: 1145754 [2019-09-07 20:06:29,054 INFO L226 Difference]: Without dead ends: 618769 [2019-09-07 20:06:30,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1523 GetRequests, 1489 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=991, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 20:06:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618769 states. [2019-09-07 20:06:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618769 to 603587. [2019-09-07 20:06:45,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603587 states. [2019-09-07 20:06:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603587 states to 603587 states and 656192 transitions. [2019-09-07 20:06:47,868 INFO L78 Accepts]: Start accepts. Automaton has 603587 states and 656192 transitions. Word has length 1464 [2019-09-07 20:06:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:47,869 INFO L475 AbstractCegarLoop]: Abstraction has 603587 states and 656192 transitions. [2019-09-07 20:06:47,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:06:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 603587 states and 656192 transitions. [2019-09-07 20:06:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-09-07 20:06:48,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:48,053 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:06:48,053 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash 137435999, now seen corresponding path program 1 times [2019-09-07 20:06:48,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 399 proven. 214 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2019-09-07 20:06:56,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:56,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:56,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:56,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1738 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 20:06:56,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:56,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:56,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:02,697 WARN L188 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-09-07 20:07:02,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1463 backedges. 1197 proven. 13 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 20:07:03,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:03,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 20:07:03,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:07:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:07:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:07:03,841 INFO L87 Difference]: Start difference. First operand 603587 states and 656192 transitions. Second operand 13 states. [2019-09-07 20:08:01,137 WARN L188 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-07 20:08:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:04,933 INFO L93 Difference]: Finished difference Result 1188235 states and 1293663 transitions. [2019-09-07 20:08:04,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-09-07 20:08:04,934 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1294 [2019-09-07 20:08:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:07,424 INFO L225 Difference]: With dead ends: 1188235 [2019-09-07 20:08:07,424 INFO L226 Difference]: Without dead ends: 649205 [2019-09-07 20:08:07,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1484 GetRequests, 1376 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4559 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1607, Invalid=10383, Unknown=0, NotChecked=0, Total=11990 [2019-09-07 20:08:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649205 states. [2019-09-07 20:08:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649205 to 632742. [2019-09-07 20:08:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632742 states. [2019-09-07 20:08:37,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632742 states to 632742 states and 684586 transitions. [2019-09-07 20:08:37,711 INFO L78 Accepts]: Start accepts. Automaton has 632742 states and 684586 transitions. Word has length 1294 [2019-09-07 20:08:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:37,711 INFO L475 AbstractCegarLoop]: Abstraction has 632742 states and 684586 transitions. [2019-09-07 20:08:37,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:08:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 632742 states and 684586 transitions. [2019-09-07 20:08:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1527 [2019-09-07 20:08:37,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:37,991 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:08:37,991 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash -39850645, now seen corresponding path program 1 times [2019-09-07 20:08:37,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 535 proven. 232 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2019-09-07 20:08:39,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:39,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:39,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:39,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 2017 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:08:39,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:39,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:39,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 1714 proven. 2 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2019-09-07 20:08:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:40,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-07 20:08:40,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:08:40,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:08:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:08:40,800 INFO L87 Difference]: Start difference. First operand 632742 states and 684586 transitions. Second operand 10 states.