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/Problem14_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:06:42,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:06:42,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:06:42,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:06:42,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:06:42,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:06:42,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:06:42,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:06:42,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:06:42,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:06:42,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:06:42,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:06:42,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:06:42,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:06:42,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:06:42,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:06:42,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:06:42,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:06:42,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:06:42,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:06:42,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:06:42,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:06:42,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:06:42,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:06:42,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:06:42,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:06:42,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:06:42,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:06:42,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:06:42,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:06:42,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:06:42,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:06:42,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:06:42,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:06:42,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:06:42,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:06:42,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:06:42,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:06:42,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:06:42,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:06:42,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:06:42,718 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 20:06:42,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:06:42,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:06:42,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:06:42,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:06:42,734 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:06:42,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:06:42,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:06:42,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:06:42,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:06:42,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:06:42,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:06:42,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:06:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:06:42,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:06:42,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:06:42,736 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:06:42,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:06:42,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:06:42,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:06:42,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:06:42,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:06:42,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:06:42,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:06:42,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:06:42,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:06:42,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:06:42,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:06:42,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:06:42,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:06:42,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:06:42,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:06:42,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:06:42,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:06:42,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:06:42,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09.c [2019-09-07 20:06:42,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba1dd017/4e0a381a9fd549e2a8ee9228a8766140/FLAG9f57fb6ae [2019-09-07 20:06:43,428 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:06:43,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label09.c [2019-09-07 20:06:43,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba1dd017/4e0a381a9fd549e2a8ee9228a8766140/FLAG9f57fb6ae [2019-09-07 20:06:43,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba1dd017/4e0a381a9fd549e2a8ee9228a8766140 [2019-09-07 20:06:43,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:06:43,703 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:06:43,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:06:43,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:06:43,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:06:43,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:06:43" (1/1) ... [2019-09-07 20:06:43,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc6461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:43, skipping insertion in model container [2019-09-07 20:06:43,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:06:43" (1/1) ... [2019-09-07 20:06:43,719 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:06:43,781 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:06:44,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:06:44,381 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:06:44,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:06:44,570 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:06:44,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44 WrapperNode [2019-09-07 20:06:44,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:06:44,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:06:44,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:06:44,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:06:44,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (1/1) ... [2019-09-07 20:06:44,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:06:44,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:06:44,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:06:44,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:06:44,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (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 20:06:44,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:06:44,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:06:44,771 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:06:44,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:06:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:06:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:06:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:06:44,773 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:06:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:06:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:06:44,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:06:46,181 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:06:46,182 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:06:46,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:06:46 BoogieIcfgContainer [2019-09-07 20:06:46,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:06:46,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:06:46,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:06:46,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:06:46,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:06:43" (1/3) ... [2019-09-07 20:06:46,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7267b566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:06:46, skipping insertion in model container [2019-09-07 20:06:46,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:06:44" (2/3) ... [2019-09-07 20:06:46,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7267b566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:06:46, skipping insertion in model container [2019-09-07 20:06:46,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:06:46" (3/3) ... [2019-09-07 20:06:46,207 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2019-09-07 20:06:46,220 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:06:46,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:06:46,251 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:06:46,301 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:06:46,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:06:46,304 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:06:46,305 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:06:46,305 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:06:46,305 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:06:46,305 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:06:46,306 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:06:46,306 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:06:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:06:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 20:06:46,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:46,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:06:46,360 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:46,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1524899170, now seen corresponding path program 1 times [2019-09-07 20:06:46,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:46,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:46,796 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 20:06:46,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:06:46,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:06:46,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:06:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:06:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:06:46,823 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-09-07 20:06:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:48,698 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2019-09-07 20:06:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:06:48,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-07 20:06:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:48,720 INFO L225 Difference]: With dead ends: 890 [2019-09-07 20:06:48,720 INFO L226 Difference]: Without dead ends: 554 [2019-09-07 20:06:48,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:06:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-07 20:06:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-09-07 20:06:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-09-07 20:06:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2019-09-07 20:06:48,824 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 51 [2019-09-07 20:06:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:48,825 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2019-09-07 20:06:48,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:06:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2019-09-07 20:06:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 20:06:48,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:48,835 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, 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 20:06:48,835 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1193901298, now seen corresponding path program 1 times [2019-09-07 20:06:48,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:48,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:48,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:49,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:06:49,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:06:49,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:06:49,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:06:49,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:06:49,090 INFO L87 Difference]: Start difference. First operand 554 states and 776 transitions. Second operand 4 states. [2019-09-07 20:06:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:50,552 INFO L93 Difference]: Finished difference Result 2194 states and 3130 transitions. [2019-09-07 20:06:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:06:50,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-07 20:06:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:50,567 INFO L225 Difference]: With dead ends: 2194 [2019-09-07 20:06:50,567 INFO L226 Difference]: Without dead ends: 1646 [2019-09-07 20:06:50,570 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:06:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-07 20:06:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-09-07 20:06:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-09-07 20:06:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2217 transitions. [2019-09-07 20:06:50,655 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2217 transitions. Word has length 163 [2019-09-07 20:06:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:50,656 INFO L475 AbstractCegarLoop]: Abstraction has 1646 states and 2217 transitions. [2019-09-07 20:06:50,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:06:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2217 transitions. [2019-09-07 20:06:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 20:06:50,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:50,669 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, 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, 1, 1, 1, 1, 1, 1, 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:50,669 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:50,670 INFO L82 PathProgramCache]: Analyzing trace with hash -825927574, now seen corresponding path program 1 times [2019-09-07 20:06:50,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:50,909 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 20:06:50,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:51,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:06:51,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:06:51,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:06:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:06:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:06:51,186 INFO L87 Difference]: Start difference. First operand 1646 states and 2217 transitions. Second operand 9 states. [2019-09-07 20:06:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:54,462 INFO L93 Difference]: Finished difference Result 6438 states and 9913 transitions. [2019-09-07 20:06:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:06:54,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 237 [2019-09-07 20:06:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:54,504 INFO L225 Difference]: With dead ends: 6438 [2019-09-07 20:06:54,504 INFO L226 Difference]: Without dead ends: 3474 [2019-09-07 20:06:54,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:06:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2019-09-07 20:06:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3024. [2019-09-07 20:06:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2019-09-07 20:06:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 4095 transitions. [2019-09-07 20:06:54,740 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 4095 transitions. Word has length 237 [2019-09-07 20:06:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:54,742 INFO L475 AbstractCegarLoop]: Abstraction has 3024 states and 4095 transitions. [2019-09-07 20:06:54,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:06:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 4095 transitions. [2019-09-07 20:06:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 20:06:54,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:54,754 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:06:54,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:54,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1188848018, now seen corresponding path program 1 times [2019-09-07 20:06:54,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:55,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:55,005 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) [2019-09-07 20:06:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:55,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:06:55,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:55,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:55,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:06:55,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:06:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:06:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:06:55,244 INFO L87 Difference]: Start difference. First operand 3024 states and 4095 transitions. Second operand 9 states. [2019-09-07 20:06:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:58,537 INFO L93 Difference]: Finished difference Result 6642 states and 9328 transitions. [2019-09-07 20:06:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:06:58,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-09-07 20:06:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:58,558 INFO L225 Difference]: With dead ends: 6642 [2019-09-07 20:06:58,558 INFO L226 Difference]: Without dead ends: 2682 [2019-09-07 20:06:58,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:06:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-09-07 20:06:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2630. [2019-09-07 20:06:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-09-07 20:06:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3390 transitions. [2019-09-07 20:06:58,666 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3390 transitions. Word has length 249 [2019-09-07 20:06:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:58,667 INFO L475 AbstractCegarLoop]: Abstraction has 2630 states and 3390 transitions. [2019-09-07 20:06:58,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:06:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3390 transitions. [2019-09-07 20:06:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 20:06:58,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:58,675 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,675 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -137313843, now seen corresponding path program 1 times [2019-09-07 20:06:58,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:58,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:58,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:58,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:58,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 120 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:06:59,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:59,090 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:59,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:59,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:06:59,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:59,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:06:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 20:06:59,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:06:59,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 20:06:59,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:06:59,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:06:59,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:06:59,381 INFO L87 Difference]: Start difference. First operand 2630 states and 3390 transitions. Second operand 12 states. [2019-09-07 20:07:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:04,240 INFO L93 Difference]: Finished difference Result 6302 states and 8347 transitions. [2019-09-07 20:07:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 20:07:04,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2019-09-07 20:07:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:04,259 INFO L225 Difference]: With dead ends: 6302 [2019-09-07 20:07:04,259 INFO L226 Difference]: Without dead ends: 3424 [2019-09-07 20:07:04,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 20:07:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2019-09-07 20:07:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3054. [2019-09-07 20:07:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2019-09-07 20:07:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 3567 transitions. [2019-09-07 20:07:04,360 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 3567 transitions. Word has length 254 [2019-09-07 20:07:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:04,360 INFO L475 AbstractCegarLoop]: Abstraction has 3054 states and 3567 transitions. [2019-09-07 20:07:04,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:07:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 3567 transitions. [2019-09-07 20:07:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-07 20:07:04,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:04,369 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, 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, 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 20:07:04,370 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1172651703, now seen corresponding path program 1 times [2019-09-07 20:07:04,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 204 proven. 176 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-07 20:07:04,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:04,804 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:07:04,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:07:04,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 401 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-07 20:07:05,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 20:07:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:07:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:07:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:07:05,111 INFO L87 Difference]: Start difference. First operand 3054 states and 3567 transitions. Second operand 10 states. [2019-09-07 20:07:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:06,405 INFO L93 Difference]: Finished difference Result 5496 states and 6415 transitions. [2019-09-07 20:07:06,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:07:06,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 404 [2019-09-07 20:07:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:06,417 INFO L225 Difference]: With dead ends: 5496 [2019-09-07 20:07:06,417 INFO L226 Difference]: Without dead ends: 2838 [2019-09-07 20:07:06,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 407 SyntacticMatches, 0 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:07:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-09-07 20:07:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2802. [2019-09-07 20:07:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-09-07 20:07:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3113 transitions. [2019-09-07 20:07:06,484 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3113 transitions. Word has length 404 [2019-09-07 20:07:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:06,485 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 3113 transitions. [2019-09-07 20:07:06,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:07:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3113 transitions. [2019-09-07 20:07:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-09-07 20:07:06,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:06,500 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, 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, 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, 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] [2019-09-07 20:07:06,500 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 469991441, now seen corresponding path program 1 times [2019-09-07 20:07:06,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 569 proven. 422 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 20:07:08,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:08,005 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:07:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:08,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:07:08,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:08,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 800 proven. 2 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-07 20:07:08,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:08,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:07:08,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:07:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:07:08,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:07:08,490 INFO L87 Difference]: Start difference. First operand 2802 states and 3113 transitions. Second operand 17 states. [2019-09-07 20:07:11,180 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 20:07:11,378 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-07 20:07:12,394 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-07 20:07:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:12,686 INFO L93 Difference]: Finished difference Result 5810 states and 6561 transitions. [2019-09-07 20:07:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 20:07:12,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 586 [2019-09-07 20:07:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:12,699 INFO L225 Difference]: With dead ends: 5810 [2019-09-07 20:07:12,700 INFO L226 Difference]: Without dead ends: 3196 [2019-09-07 20:07:12,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=344, Invalid=1296, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 20:07:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2019-09-07 20:07:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2804. [2019-09-07 20:07:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2019-09-07 20:07:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3076 transitions. [2019-09-07 20:07:12,764 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3076 transitions. Word has length 586 [2019-09-07 20:07:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:12,765 INFO L475 AbstractCegarLoop]: Abstraction has 2804 states and 3076 transitions. [2019-09-07 20:07:12,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:07:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3076 transitions. [2019-09-07 20:07:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-09-07 20:07:12,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:12,783 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, 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, 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, 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] [2019-09-07 20:07:12,784 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1240943570, now seen corresponding path program 1 times [2019-09-07 20:07:12,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:12,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 348 proven. 389 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-09-07 20:07:13,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:13,733 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:07:13,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:13,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:07:13,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 519 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 20:07:14,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:14,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-09-07 20:07:14,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 20:07:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 20:07:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:07:14,163 INFO L87 Difference]: Start difference. First operand 2804 states and 3076 transitions. Second operand 17 states. [2019-09-07 20:07:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:21,298 INFO L93 Difference]: Finished difference Result 7846 states and 8805 transitions. [2019-09-07 20:07:21,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 20:07:21,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 619 [2019-09-07 20:07:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:21,315 INFO L225 Difference]: With dead ends: 7846 [2019-09-07 20:07:21,315 INFO L226 Difference]: Without dead ends: 5232 [2019-09-07 20:07:21,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 20:07:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2019-09-07 20:07:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 4846. [2019-09-07 20:07:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4846 states. [2019-09-07 20:07:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 5353 transitions. [2019-09-07 20:07:21,427 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 5353 transitions. Word has length 619 [2019-09-07 20:07:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:21,428 INFO L475 AbstractCegarLoop]: Abstraction has 4846 states and 5353 transitions. [2019-09-07 20:07:21,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 20:07:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 5353 transitions. [2019-09-07 20:07:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-09-07 20:07:21,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:21,440 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, 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, 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, 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] [2019-09-07 20:07:21,440 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:21,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1848262589, now seen corresponding path program 1 times [2019-09-07 20:07:21,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:21,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:21,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:21,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 726 proven. 710 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 20:07:22,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:22,493 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:07:22,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:22,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:07:22,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:22,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 1008 proven. 2 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-09-07 20:07:23,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:23,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:07:23,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:07:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:07:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:07:23,005 INFO L87 Difference]: Start difference. First operand 4846 states and 5353 transitions. Second operand 14 states. [2019-09-07 20:07:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:26,660 INFO L93 Difference]: Finished difference Result 9936 states and 11081 transitions. [2019-09-07 20:07:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 20:07:26,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 674 [2019-09-07 20:07:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:26,679 INFO L225 Difference]: With dead ends: 9936 [2019-09-07 20:07:26,680 INFO L226 Difference]: Without dead ends: 5280 [2019-09-07 20:07:26,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 20:07:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-09-07 20:07:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5030. [2019-09-07 20:07:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-09-07 20:07:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 5526 transitions. [2019-09-07 20:07:26,790 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 5526 transitions. Word has length 674 [2019-09-07 20:07:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:26,791 INFO L475 AbstractCegarLoop]: Abstraction has 5030 states and 5526 transitions. [2019-09-07 20:07:26,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:07:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 5526 transitions. [2019-09-07 20:07:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2019-09-07 20:07:26,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:26,802 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, 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, 6, 6, 5, 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, 1, 1, 1, 1, 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:07:26,802 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash -655372082, now seen corresponding path program 1 times [2019-09-07 20:07:26,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:26,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 824 proven. 946 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-09-07 20:07:29,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:29,139 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:07:29,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:07:29,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:29,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 835 proven. 2 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-07 20:07:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 20:07:29,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 20:07:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 20:07:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:07:29,666 INFO L87 Difference]: Start difference. First operand 5030 states and 5526 transitions. Second operand 21 states. [2019-09-07 20:07:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:35,722 INFO L93 Difference]: Finished difference Result 10666 states and 11882 transitions. [2019-09-07 20:07:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 20:07:35,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 833 [2019-09-07 20:07:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:35,753 INFO L225 Difference]: With dead ends: 10666 [2019-09-07 20:07:35,753 INFO L226 Difference]: Without dead ends: 5826 [2019-09-07 20:07:35,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 866 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=883, Invalid=4373, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 20:07:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5826 states. [2019-09-07 20:07:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5826 to 5592. [2019-09-07 20:07:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5592 states. [2019-09-07 20:07:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 6068 transitions. [2019-09-07 20:07:35,875 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 6068 transitions. Word has length 833 [2019-09-07 20:07:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:35,876 INFO L475 AbstractCegarLoop]: Abstraction has 5592 states and 6068 transitions. [2019-09-07 20:07:35,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 20:07:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 6068 transitions. [2019-09-07 20:07:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2019-09-07 20:07:35,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:35,887 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 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, 4, 3, 3, 3, 3, 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] [2019-09-07 20:07:35,888 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1267620710, now seen corresponding path program 1 times [2019-09-07 20:07:35,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:35,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:35,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 884 proven. 43 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2019-09-07 20:07:36,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:36,771 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:07:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:36,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 20:07:36,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:36,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:36,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:37,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:37,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 884 proven. 43 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2019-09-07 20:07:37,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:37,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2019-09-07 20:07:37,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:07:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:07:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:07:37,996 INFO L87 Difference]: Start difference. First operand 5592 states and 6068 transitions. Second operand 10 states. [2019-09-07 20:07:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:40,531 INFO L93 Difference]: Finished difference Result 12690 states and 13982 transitions. [2019-09-07 20:07:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:07:40,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 835 [2019-09-07 20:07:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:40,553 INFO L225 Difference]: With dead ends: 12690 [2019-09-07 20:07:40,553 INFO L226 Difference]: Without dead ends: 7288 [2019-09-07 20:07:40,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 839 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:07:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7288 states. [2019-09-07 20:07:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7288 to 6352. [2019-09-07 20:07:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-09-07 20:07:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 7052 transitions. [2019-09-07 20:07:40,694 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 7052 transitions. Word has length 835 [2019-09-07 20:07:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:40,695 INFO L475 AbstractCegarLoop]: Abstraction has 6352 states and 7052 transitions. [2019-09-07 20:07:40,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:07:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 7052 transitions. [2019-09-07 20:07:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2019-09-07 20:07:40,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:40,712 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 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, 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] [2019-09-07 20:07:40,713 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:40,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash -402334059, now seen corresponding path program 1 times [2019-09-07 20:07:40,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:40,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:40,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 484 proven. 819 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2019-09-07 20:07:42,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:07:42,260 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:07:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:42,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 20:07:42,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:42,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,931 WARN L188 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 223 DAG size of output: 28 [2019-09-07 20:07:44,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:07:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:44,163 WARN L188 SmtUtils]: Spent 1.96 m on a formula simplification. DAG size of input: 1017 DAG size of output: 223 [2019-09-07 20:09:44,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-09-07 20:09:44,312 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-09-07 20:09:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 1248 proven. 167 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-09-07 20:09:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-09-07 20:09:45,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:09:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:09:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:09:45,824 INFO L87 Difference]: Start difference. First operand 6352 states and 7052 transitions. Second operand 20 states. [2019-09-07 20:12:35,144 WARN L188 SmtUtils]: Spent 2.75 m on a formula simplification. DAG size of input: 259 DAG size of output: 229 [2019-09-07 20:12:37,407 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-07 20:12:38,116 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-09-07 20:14:39,610 WARN L188 SmtUtils]: Spent 2.02 m on a formula simplification. DAG size of input: 261 DAG size of output: 248 [2019-09-07 20:15:39,517 WARN L188 SmtUtils]: Spent 56.94 s on a formula simplification. DAG size of input: 262 DAG size of output: 216 [2019-09-07 20:15:41,961 WARN L188 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-07 20:15:44,364 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-09-07 20:15:45,145 WARN L188 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-09-07 20:16:44,635 WARN L188 SmtUtils]: Spent 58.80 s on a formula simplification that was a NOOP. DAG size: 254 [2019-09-07 20:16:50,108 WARN L188 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-07 20:16:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:16:52,759 INFO L93 Difference]: Finished difference Result 14305 states and 15898 transitions. [2019-09-07 20:16:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-07 20:16:52,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 954 [2019-09-07 20:16:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:16:52,784 INFO L225 Difference]: With dead ends: 14305 [2019-09-07 20:16:52,784 INFO L226 Difference]: Without dead ends: 7953 [2019-09-07 20:16:52,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 1000 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 535.7s TimeCoverageRelationStatistics Valid=1525, Invalid=8776, Unknown=1, NotChecked=0, Total=10302 [2019-09-07 20:16:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2019-09-07 20:16:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 6916. [2019-09-07 20:16:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6916 states. [2019-09-07 20:16:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 7634 transitions. [2019-09-07 20:16:52,946 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 7634 transitions. Word has length 954 [2019-09-07 20:16:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:16:52,947 INFO L475 AbstractCegarLoop]: Abstraction has 6916 states and 7634 transitions. [2019-09-07 20:16:52,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:16:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 7634 transitions. [2019-09-07 20:16:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-09-07 20:16:52,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:16:52,964 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 3, 3, 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 20:16:52,965 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:16:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:16:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash 445945781, now seen corresponding path program 1 times [2019-09-07 20:16:52,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:16:52,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:16:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:52,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:53,866 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 20:16:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 1162 proven. 1226 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-09-07 20:16:55,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:16:55,065 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:16:55,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:16:55,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:16:55,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:16:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2019-09-07 20:16:55,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:16:55,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-09-07 20:16:55,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:16:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:16:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:16:55,831 INFO L87 Difference]: Start difference. First operand 6916 states and 7634 transitions. Second operand 15 states. [2019-09-07 20:16:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:16:58,486 INFO L93 Difference]: Finished difference Result 13927 states and 15897 transitions. [2019-09-07 20:16:58,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:16:58,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1050 [2019-09-07 20:16:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:16:58,513 INFO L225 Difference]: With dead ends: 13927 [2019-09-07 20:16:58,513 INFO L226 Difference]: Without dead ends: 7076 [2019-09-07 20:16:58,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1068 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 20:16:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7076 states. [2019-09-07 20:16:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7076 to 6763. [2019-09-07 20:16:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6763 states. [2019-09-07 20:16:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 7392 transitions. [2019-09-07 20:16:58,676 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 7392 transitions. Word has length 1050 [2019-09-07 20:16:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:16:58,677 INFO L475 AbstractCegarLoop]: Abstraction has 6763 states and 7392 transitions. [2019-09-07 20:16:58,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:16:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 7392 transitions. [2019-09-07 20:16:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2019-09-07 20:16:58,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:16:58,697 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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] [2019-09-07 20:16:58,698 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:16:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:16:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -283677738, now seen corresponding path program 1 times [2019-09-07 20:16:58,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:16:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:16:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:16:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:16:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3414 backedges. 834 proven. 47 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2019-09-07 20:17:00,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:17:00,116 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) [2019-09-07 20:17:00,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:17:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:17:00,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 20:17:00,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:17:00,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:00,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:17:55,555 WARN L188 SmtUtils]: Spent 54.77 s on a formula simplification. DAG size of input: 133 DAG size of output: 83 [2019-09-07 20:17:55,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 20:17:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3414 backedges. 1519 proven. 94 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-09-07 20:17:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:17:56,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-09-07 20:17:56,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 20:17:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 20:17:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:17:56,787 INFO L87 Difference]: Start difference. First operand 6763 states and 7392 transitions. Second operand 16 states. [2019-09-07 20:18:48,925 WARN L188 SmtUtils]: Spent 46.91 s on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-09-07 20:18:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:18:52,671 INFO L93 Difference]: Finished difference Result 13407 states and 14671 transitions. [2019-09-07 20:18:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 20:18:52,671 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1087 [2019-09-07 20:18:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:18:52,687 INFO L225 Difference]: With dead ends: 13407 [2019-09-07 20:18:52,687 INFO L226 Difference]: Without dead ends: 6787 [2019-09-07 20:18:52,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1104 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 103.0s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 20:18:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2019-09-07 20:18:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 6773. [2019-09-07 20:18:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6773 states. [2019-09-07 20:18:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 7329 transitions. [2019-09-07 20:18:52,819 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 7329 transitions. Word has length 1087 [2019-09-07 20:18:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:18:52,821 INFO L475 AbstractCegarLoop]: Abstraction has 6773 states and 7329 transitions. [2019-09-07 20:18:52,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 20:18:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 7329 transitions. [2019-09-07 20:18:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2019-09-07 20:18:52,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:18:52,843 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:18:52,843 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:18:52,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:18:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -569851947, now seen corresponding path program 1 times [2019-09-07 20:18:52,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:18:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:18:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:52,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:18:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1154 proven. 1840 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2019-09-07 20:18:56,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:18:56,066 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:18:56,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:18:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:18:56,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:18:56,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:18:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1245 proven. 2 refuted. 0 times theorem prover too weak. 2729 trivial. 0 not checked. [2019-09-07 20:18:56,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:18:56,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-09-07 20:18:56,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:18:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:18:56,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:18:56,860 INFO L87 Difference]: Start difference. First operand 6773 states and 7329 transitions. Second operand 20 states. [2019-09-07 20:19:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:02,228 INFO L93 Difference]: Finished difference Result 13158 states and 14266 transitions. [2019-09-07 20:19:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 20:19:02,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1126 [2019-09-07 20:19:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:02,244 INFO L225 Difference]: With dead ends: 13158 [2019-09-07 20:19:02,244 INFO L226 Difference]: Without dead ends: 6387 [2019-09-07 20:19:02,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1152 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=565, Invalid=2741, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 20:19:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2019-09-07 20:19:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 4315. [2019-09-07 20:19:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4315 states. [2019-09-07 20:19:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 4460 transitions. [2019-09-07 20:19:02,342 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 4460 transitions. Word has length 1126 [2019-09-07 20:19:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:02,343 INFO L475 AbstractCegarLoop]: Abstraction has 4315 states and 4460 transitions. [2019-09-07 20:19:02,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:19:02,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 4460 transitions. [2019-09-07 20:19:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1532 [2019-09-07 20:19:02,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:19:02,372 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 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:19:02,372 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:19:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:19:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -628232518, now seen corresponding path program 1 times [2019-09-07 20:19:02,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:19:02,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:19:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:02,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7178 backedges. 1231 proven. 3634 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2019-09-07 20:19:06,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:06,249 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:19:06,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:06,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:19:06,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:06,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:19:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7178 backedges. 3980 proven. 2 refuted. 0 times theorem prover too weak. 3196 trivial. 0 not checked. [2019-09-07 20:19:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:19:07,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 20:19:07,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 20:19:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 20:19:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:19:07,494 INFO L87 Difference]: Start difference. First operand 4315 states and 4460 transitions. Second operand 19 states. [2019-09-07 20:19:09,444 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-07 20:19:10,874 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-07 20:19:12,003 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-07 20:19:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:12,942 INFO L93 Difference]: Finished difference Result 8568 states and 9031 transitions. [2019-09-07 20:19:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 20:19:12,942 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1531 [2019-09-07 20:19:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:12,953 INFO L225 Difference]: With dead ends: 8568 [2019-09-07 20:19:12,953 INFO L226 Difference]: Without dead ends: 4443 [2019-09-07 20:19:12,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1613 GetRequests, 1557 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=676, Invalid=2294, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 20:19:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2019-09-07 20:19:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4305. [2019-09-07 20:19:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-09-07 20:19:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 4419 transitions. [2019-09-07 20:19:13,039 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 4419 transitions. Word has length 1531 [2019-09-07 20:19:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:13,040 INFO L475 AbstractCegarLoop]: Abstraction has 4305 states and 4419 transitions. [2019-09-07 20:19:13,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 20:19:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 4419 transitions. [2019-09-07 20:19:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1911 [2019-09-07 20:19:13,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:19:13,080 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-09-07 20:19:13,080 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:19:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:19:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1986156781, now seen corresponding path program 1 times [2019-09-07 20:19:13,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:19:13,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:19:13,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:13,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11274 backedges. 4705 proven. 4146 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2019-09-07 20:19:19,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:19,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:19:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:19,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:19:19,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11274 backedges. 5077 proven. 2 refuted. 0 times theorem prover too weak. 6195 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:19:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:19:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-09-07 20:19:20,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:19:20,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:19:20,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:19:20,748 INFO L87 Difference]: Start difference. First operand 4305 states and 4419 transitions. Second operand 20 states. [2019-09-07 20:19:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:27,175 INFO L93 Difference]: Finished difference Result 8178 states and 8493 transitions. [2019-09-07 20:19:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 20:19:27,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1910 [2019-09-07 20:19:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:27,186 INFO L225 Difference]: With dead ends: 8178 [2019-09-07 20:19:27,186 INFO L226 Difference]: Without dead ends: 4063 [2019-09-07 20:19:27,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2002 GetRequests, 1946 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=669, Invalid=2637, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 20:19:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2019-09-07 20:19:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3935. [2019-09-07 20:19:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3935 states. [2019-09-07 20:19:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4018 transitions. [2019-09-07 20:19:27,264 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4018 transitions. Word has length 1910 [2019-09-07 20:19:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:27,266 INFO L475 AbstractCegarLoop]: Abstraction has 3935 states and 4018 transitions. [2019-09-07 20:19:27,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:19:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4018 transitions. [2019-09-07 20:19:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1959 [2019-09-07 20:19:27,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:19:27,311 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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] [2019-09-07 20:19:27,311 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:19:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:19:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash -183242675, now seen corresponding path program 1 times [2019-09-07 20:19:27,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:19:27,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:19:27,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:27,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:19:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:19:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11734 backedges. 6120 proven. 1595 refuted. 0 times theorem prover too weak. 4019 trivial. 0 not checked. [2019-09-07 20:19:32,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:19:32,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:19:32,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:19:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:19:32,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 2630 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:19:32,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:19:32,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:19:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11734 backedges. 1719 proven. 2 refuted. 0 times theorem prover too weak. 10013 trivial. 0 not checked. [2019-09-07 20:19:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:19:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 20:19:34,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 20:19:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 20:19:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:19:34,176 INFO L87 Difference]: Start difference. First operand 3935 states and 4018 transitions. Second operand 21 states. [2019-09-07 20:19:36,518 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-07 20:19:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:19:41,189 INFO L93 Difference]: Finished difference Result 7780 states and 8006 transitions. [2019-09-07 20:19:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 20:19:41,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1958 [2019-09-07 20:19:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:19:41,191 INFO L225 Difference]: With dead ends: 7780 [2019-09-07 20:19:41,192 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:19:41,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 1984 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=577, Invalid=2615, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 20:19:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:19:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:19:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:19:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:19:41,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1958 [2019-09-07 20:19:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:19:41,203 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:19:41,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 20:19:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:19:41,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:19:41,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:19:44,293 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 893 DAG size of output: 703 [2019-09-07 20:19:45,957 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 893 DAG size of output: 703 [2019-09-07 20:19:50,379 WARN L188 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 459 DAG size of output: 157 [2019-09-07 20:20:07,461 WARN L188 SmtUtils]: Spent 17.06 s on a formula simplification. DAG size of input: 694 DAG size of output: 131 [2019-09-07 20:20:24,580 WARN L188 SmtUtils]: Spent 17.11 s on a formula simplification. DAG size of input: 694 DAG size of output: 131 [2019-09-07 20:20:24,582 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-09-07 20:20:24,583 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,584 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,585 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-09-07 20:20:24,586 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:20:24,587 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:20:24,588 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-09-07 20:20:24,589 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,590 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,591 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-09-07 20:20:24,592 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse12 (= 6 |old(~a21~0)|))) (let ((.cse22 (= ~a24~0 |old(~a24~0)|)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse9 (= ~a15~0 |old(~a15~0)|)) (.cse18 (<= ~a12~0 |old(~a12~0)|)) (.cse19 (<= |old(~a12~0)| ~a12~0)) (.cse23 (= ~a21~0 |old(~a21~0)|)) (.cse20 (= ~a24~0 1)) (.cse21 (= ~a15~0 9)) (.cse24 (not .cse12)) (.cse10 (not (<= |old(~a15~0)| 6))) (.cse17 (not (<= |old(~a12~0)| 11)))) (let ((.cse13 (not (= ~a21~0 6))) (.cse8 (= ~a21~0 9)) (.cse3 (or .cse24 .cse10 .cse17)) (.cse15 (not (= 7 |old(~a15~0)|))) (.cse25 (not (= 7 |old(~a21~0)|))) (.cse7 (not (= 9 |old(~a21~0)|))) (.cse29 (not (<= (+ |old(~a12~0)| 49) 0))) (.cse28 (<= (+ ~a12~0 49) 0)) (.cse4 (not (= 9 |old(~a15~0)|))) (.cse5 (and .cse18 .cse19 .cse23 .cse20 .cse21)) (.cse14 (not (< 80 |old(~a12~0)|))) (.cse11 (not (= 6 |old(~a15~0)|))) (.cse30 (<= ~a12~0 11)) (.cse16 (not (<= 10 |old(~a21~0)|))) (.cse32 (and (or .cse10 .cse17) (or .cse12 .cse10))) (.cse27 (not (= 8 |old(~a15~0)|))) (.cse31 (not (<= |old(~a12~0)| 73282))) (.cse6 (not (= 8 |old(~a21~0)|))) (.cse26 (and .cse22 .cse0 .cse23 .cse9)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse2 (not (= 5 |old(~a15~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 (not (<= |old(~a12~0)| 72)) .cse5 .cse6) (or .cse7 (and .cse8 .cse9) .cse10) (or .cse11 .cse12 .cse13) (or .cse4 .cse5 .cse1 .cse14 .cse6) (or .cse12 .cse13 .cse15) (or .cse11 .cse9) (or .cse4 .cse5 .cse16 .cse1 .cse17) (or .cse7 .cse4 (and .cse18 .cse19 .cse8 .cse20 .cse21) .cse1 .cse14) (or .cse7 .cse15 .cse8) (or (and .cse22 .cse23 .cse9) .cse1 .cse2 .cse17) (or .cse5 .cse24 .cse4 .cse1 .cse14) (or .cse14 .cse4 .cse25 (and .cse18 .cse19 .cse20 (= ~a21~0 7) .cse21) .cse1) (or .cse26 (or (not (< 22 |old(~a12~0)|)) (not (<= |old(~a12~0)| 76)) .cse27 .cse7 .cse1)) (or .cse28 .cse29 .cse15) (or (and (and .cse0 .cse8 .cse20) .cse9) (or .cse7 .cse1 .cse17 .cse27)) (or (or (not (<= |old(~a12~0)| 599997)) .cse24 .cse27) .cse1 .cse26) (or (and (and .cse18 .cse22 .cse23 .cse9) .cse19) .cse3 (not (<= (+ |old(~a12~0)| 45156) 0))) (or .cse9 .cse15) (or .cse30 .cse17 .cse15) (or (and .cse0 .cse22 .cse23 .cse9) (or .cse25 .cse1 .cse17 .cse27)) (or .cse7 .cse10 .cse29 .cse28) (or .cse4 .cse16 .cse5 .cse1 .cse14) (or .cse12 (and .cse0 .cse20 .cse23 .cse9) .cse1 .cse31 .cse32) (or (not (= 10 |old(~a21~0)|)) (forall ((v_prenex_65 Int)) (or (not (< 80 v_prenex_65)) (not (<= 0 v_prenex_65)) (not (<= |old(~a12~0)| (+ (mod v_prenex_65 299959) 300039))))) .cse1 .cse27 (and .cse18 .cse19 .cse23 .cse9 .cse20)) (or .cse11 .cse12 .cse17 .cse30) (or .cse16 .cse31 .cse32 (and (and .cse22 .cse0) .cse23 .cse9)) (or (or .cse27 .cse31 .cse6) .cse1 .cse26) (or .cse24 (not (<= 526013 |old(~a12~0)|)) (and .cse0 .cse23 .cse9 .cse20) .cse1 .cse2))))) [2019-09-07 20:20:24,592 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,593 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,594 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-09-07 20:20:24,595 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-09-07 20:20:24,596 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-09-07 20:20:24,597 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,598 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-09-07 20:20:24,599 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-09-07 20:20:24,600 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,601 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-09-07 20:20:24,602 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-09-07 20:20:24,603 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:20:24,604 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:20:24,605 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-09-07 20:20:24,606 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a15~0 8) (= ~a24~0 1) (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) [2019-09-07 20:20:24,607 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:20:24,607 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a15~0 |old(~a15~0)|) (= ~a24~0 1) (= ~a21~0 7))) [2019-09-07 20:20:24,607 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:20:24,608 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse8 (= ~a21~0 6))) (let ((.cse15 (not .cse8)) (.cse0 (<= ~a15~0 6)) (.cse11 (<= ~a12~0 11))) (let ((.cse14 (= ~a15~0 8)) (.cse2 (= ~a24~0 1)) (.cse6 (not (= 8 |old(~a15~0)|))) (.cse17 (or (and .cse0 .cse15) (and .cse0 .cse11)))) (let ((.cse3 (= ~a21~0 7)) (.cse7 (= ~a24~0 |old(~a24~0)|)) (.cse16 (<= ~a12~0 73282)) (.cse12 (<= 10 ~a21~0)) (.cse9 (and .cse17 (or (< 80 |old(~a12~0)|) (<= (+ |old(~a12~0)| 43) 0)))) (.cse13 (= ~a21~0 8)) (.cse1 (= ~a21~0 9)) (.cse4 (= ~a15~0 9)) (.cse5 (< 80 ~a12~0)) (.cse18 (= ~a15~0 5)) (.cse10 (and .cse14 .cse2 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse6)))) (or (and .cse0 .cse1) (and (and (and .cse2 .cse3) .cse4) .cse5) .cse6 (and (and .cse7 .cse8) .cse4 .cse5) (and (<= (+ ~a12~0 45156) 0) (and .cse8 .cse9)) (= ~a15~0 7) (and (<= ~a12~0 599997) (and .cse8 .cse10)) (and .cse2 (and (and (<= ~a15~0 8) .cse1) .cse11)) (and (and .cse12 .cse7) .cse4 .cse5) (and (and (and .cse7 .cse13) (<= ~a12~0 72)) .cse4) (not (= 7 |old(~a21~0)|)) (and (and (and .cse14 .cse3) .cse11) .cse2) (and .cse15 (and .cse16 .cse2 .cse17)) (and .cse2 (and (and (<= ~a12~0 76) (< 22 ~a12~0) .cse14) .cse1)) (and (and (and .cse12 .cse11) .cse7) .cse4) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and (and .cse16 .cse13) .cse7) (= ~a15~0 |old(~a15~0)|)) (and .cse16 .cse12 .cse9) (and (and .cse2 .cse13) .cse4 .cse5) (and (and (and .cse2 .cse1) .cse4) .cse5) (and .cse2 .cse18 .cse11) (and .cse8 (<= 526013 ~a12~0) .cse18 .cse2) (and (and .cse10 (exists ((v_prenex_65 Int)) (and (<= ~a12~0 (+ (mod v_prenex_65 299959) 300039)) (< 80 v_prenex_65) (<= 0 v_prenex_65)))) (= ~a21~0 10)) (not (= 1 |old(~a24~0)|)) (= ~a15~0 6)))))) [2019-09-07 20:20:24,608 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-09-07 20:20:24,608 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-09-07 20:20:24,609 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse8 (= ~a21~0 6))) (let ((.cse15 (not .cse8)) (.cse0 (<= ~a15~0 6)) (.cse11 (<= ~a12~0 11))) (let ((.cse14 (= ~a15~0 8)) (.cse2 (= ~a24~0 1)) (.cse6 (not (= 8 |old(~a15~0)|))) (.cse17 (or (and .cse0 .cse15) (and .cse0 .cse11)))) (let ((.cse3 (= ~a21~0 7)) (.cse7 (= ~a24~0 |old(~a24~0)|)) (.cse16 (<= ~a12~0 73282)) (.cse12 (<= 10 ~a21~0)) (.cse9 (and .cse17 (or (< 80 |old(~a12~0)|) (<= (+ |old(~a12~0)| 43) 0)))) (.cse13 (= ~a21~0 8)) (.cse1 (= ~a21~0 9)) (.cse4 (= ~a15~0 9)) (.cse5 (< 80 ~a12~0)) (.cse18 (= ~a15~0 5)) (.cse10 (and .cse14 .cse2 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse6)))) (or (and .cse0 .cse1) (and (and (and .cse2 .cse3) .cse4) .cse5) .cse6 (and (and .cse7 .cse8) .cse4 .cse5) (and (<= (+ ~a12~0 45156) 0) (and .cse8 .cse9)) (= ~a15~0 7) (and (<= ~a12~0 599997) (and .cse8 .cse10)) (and .cse2 (and (and (<= ~a15~0 8) .cse1) .cse11)) (and (and .cse12 .cse7) .cse4 .cse5) (and (and (and .cse7 .cse13) (<= ~a12~0 72)) .cse4) (not (= 7 |old(~a21~0)|)) (and (and (and .cse14 .cse3) .cse11) .cse2) (and .cse15 (and .cse16 .cse2 .cse17)) (and .cse2 (and (and (<= ~a12~0 76) (< 22 ~a12~0) .cse14) .cse1)) (and (and (and .cse12 .cse11) .cse7) .cse4) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and (and .cse16 .cse13) .cse7) (= ~a15~0 |old(~a15~0)|)) (and .cse16 .cse12 .cse9) (and (and .cse2 .cse13) .cse4 .cse5) (and (and (and .cse2 .cse1) .cse4) .cse5) (and .cse2 .cse18 .cse11) (and .cse8 (<= 526013 ~a12~0) .cse18 .cse2) (and (and .cse10 (exists ((v_prenex_65 Int)) (and (<= ~a12~0 (+ (mod v_prenex_65 299959) 300039)) (< 80 v_prenex_65) (<= 0 v_prenex_65)))) (= ~a21~0 10)) (not (= 1 |old(~a24~0)|)) (= ~a15~0 6)))))) [2019-09-07 20:20:24,609 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-09-07 20:20:24,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:20:24 BoogieIcfgContainer [2019-09-07 20:20:24,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:20:24,639 INFO L168 Benchmark]: Toolchain (without parser) took 820936.02 ms. Allocated memory was 132.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 86.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,640 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.48 ms. Allocated memory was 132.1 MB in the beginning and 201.9 MB in the end (delta: 69.7 MB). Free memory was 85.9 MB in the beginning and 154.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,641 INFO L168 Benchmark]: Boogie Preprocessor took 123.54 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 149.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,642 INFO L168 Benchmark]: RCFGBuilder took 1490.62 ms. Allocated memory was 201.9 MB in the beginning and 224.4 MB in the end (delta: 22.5 MB). Free memory was 149.5 MB in the beginning and 144.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,643 INFO L168 Benchmark]: TraceAbstraction took 818450.77 ms. Allocated memory was 224.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 144.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:20:24,647 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.48 ms. Allocated memory was 132.1 MB in the beginning and 201.9 MB in the end (delta: 69.7 MB). Free memory was 85.9 MB in the beginning and 154.9 MB in the end (delta: -69.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.54 ms. Allocated memory is still 201.9 MB. Free memory was 154.9 MB in the beginning and 149.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1490.62 ms. Allocated memory was 201.9 MB in the beginning and 224.4 MB in the end (delta: 22.5 MB). Free memory was 149.5 MB in the beginning and 144.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 818450.77 ms. Allocated memory was 224.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 144.8 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-09-07 20:20:24,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-09-07 20:20:24,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a15 <= 6 && a21 == 9) || (((a24 == 1 && a21 == 7) && a15 == 9) && 80 < a12)) || !(8 == \old(a15))) || (((a24 == \old(a24) && a21 == 6) && a15 == 9) && 80 < a12)) || (a12 + 45156 <= 0 && a21 == 6 && ((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && (80 < \old(a12) || \old(a12) + 43 <= 0))) || a15 == 7) || (a12 <= 599997 && a21 == 6 && (a15 == 8 && a24 == 1) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15))))) || (a24 == 1 && (a15 <= 8 && a21 == 9) && a12 <= 11)) || (((10 <= a21 && a24 == \old(a24)) && a15 == 9) && 80 < a12)) || (((a24 == \old(a24) && a21 == 8) && a12 <= 72) && a15 == 9)) || !(7 == \old(a21))) || (((a15 == 8 && a21 == 7) && a12 <= 11) && a24 == 1)) || (!(a21 == 6) && (a12 <= 73282 && a24 == 1) && ((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)))) || (a24 == 1 && ((a12 <= 76 && 22 < a12) && a15 == 8) && a21 == 9)) || (((10 <= a21 && a12 <= 11) && a24 == \old(a24)) && a15 == 9)) || !(\old(a12) + 49 <= 0)) || (((a12 <= 73282 && a21 == 8) && a24 == \old(a24)) && a15 == \old(a15))) || ((a12 <= 73282 && 10 <= a21) && ((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && (80 < \old(a12) || \old(a12) + 43 <= 0))) || (((a24 == 1 && a21 == 8) && a15 == 9) && 80 < a12)) || (((a24 == 1 && a21 == 9) && a15 == 9) && 80 < a12)) || ((a24 == 1 && a15 == 5) && a12 <= 11)) || (((a21 == 6 && 526013 <= a12) && a15 == 5) && a24 == 1)) || ((((a15 == 8 && a24 == 1) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (\exists v_prenex_65 : int :: (a12 <= v_prenex_65 % 299959 + 300039 && 80 < v_prenex_65) && 0 <= v_prenex_65)) && a21 == 10)) || !(1 == \old(a24))) || a15 == 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 818.3s OverallTime, 18 OverallIterations, 16 TraceHistogramMax, 549.9s AutomataDifference, 0.0s DeadEndRemovalTime, 43.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 820 SDtfs, 52134 SDslu, 3196 SDs, 0 SdLazy, 60674 SolverSat, 7659 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 59.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15368 GetRequests, 14646 SyntacticMatches, 18 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11835 ImplicationChecksByTransitivity, 657.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6916occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 6808 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 592 PreInvPairs, 766 NumberOfFragments, 1610 HoareAnnotationTreeSize, 592 FomulaSimplifications, 51359042 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 719620 FormulaSimplificationTreeSizeReductionInter, 38.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 196.6s InterpolantComputationTime, 28828 NumberOfCodeBlocks, 28828 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 28794 ConstructedInterpolants, 63 QuantifiedInterpolants, 130646905 SizeOfPredicates, 16 NumberOfNonLiveVariables, 20283 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 90044/106408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...