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/Problem15_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:28:06,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:28:06,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:28:06,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:28:06,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:28:06,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:28:06,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:28:06,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:28:06,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:28:06,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:28:06,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:28:06,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:28:06,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:28:06,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:28:06,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:28:06,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:28:06,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:28:06,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:28:06,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:28:06,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:28:06,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:28:06,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:28:06,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:28:06,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:28:06,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:28:06,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:28:06,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:28:06,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:28:06,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:28:06,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:28:06,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:28:06,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:28:06,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:28:06,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:28:06,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:28:06,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:28:06,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:28:06,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:28:06,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:28:06,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:28:06,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:28:06,717 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-10-02 01:28:06,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:28:06,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:28:06,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:28:06,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:28:06,743 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:28:06,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:28:06,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:28:06,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:28:06,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:28:06,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:28:06,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:28:06,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:28:06,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:28:06,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:28:06,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:28:06,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:28:06,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:28:06,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:28:06,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:28:06,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:28:06,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:28:06,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:28:06,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:28:06,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:28:06,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:28:06,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:28:06,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:28:06,805 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:28:06,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-10-02 01:28:06,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4244a1f47/b739b7270d7e4d31b327c0f3abc456ef/FLAG8f491cc58 [2019-10-02 01:28:07,628 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:28:07,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-10-02 01:28:07,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4244a1f47/b739b7270d7e4d31b327c0f3abc456ef/FLAG8f491cc58 [2019-10-02 01:28:07,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4244a1f47/b739b7270d7e4d31b327c0f3abc456ef [2019-10-02 01:28:07,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:28:07,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:28:07,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:28:07,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:28:07,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:28:07,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:28:07" (1/1) ... [2019-10-02 01:28:07,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a8eca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:07, skipping insertion in model container [2019-10-02 01:28:07,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:28:07" (1/1) ... [2019-10-02 01:28:07,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:28:07,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:28:08,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:28:08,765 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:28:09,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:28:09,179 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:28:09,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09 WrapperNode [2019-10-02 01:28:09,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:28:09,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:28:09,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:28:09,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:28:09,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (1/1) ... [2019-10-02 01:28:09,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:28:09,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:28:09,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:28:09,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:28:09,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (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-10-02 01:28:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:28:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:28:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:28:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 01:28:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:28:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:28:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 01:28:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:28:09,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:28:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:28:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:28:09,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:28:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:28:13,424 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:28:13,425 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:28:13,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:28:13 BoogieIcfgContainer [2019-10-02 01:28:13,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:28:13,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:28:13,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:28:13,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:28:13,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:28:07" (1/3) ... [2019-10-02 01:28:13,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:28:13, skipping insertion in model container [2019-10-02 01:28:13,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:28:09" (2/3) ... [2019-10-02 01:28:13,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:28:13, skipping insertion in model container [2019-10-02 01:28:13,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:28:13" (3/3) ... [2019-10-02 01:28:13,436 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2019-10-02 01:28:13,449 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:28:13,461 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:28:13,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:28:13,532 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:28:13,533 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:28:13,533 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:28:13,533 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:28:13,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:28:13,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:28:13,534 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:28:13,534 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:28:13,534 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:28:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-10-02 01:28:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 01:28:13,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:13,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:13,585 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1661413296, now seen corresponding path program 1 times [2019-10-02 01:28:13,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:13,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:13,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:28:14,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:28:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:28:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:14,151 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-10-02 01:28:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:19,416 INFO L93 Difference]: Finished difference Result 1546 states and 2831 transitions. [2019-10-02 01:28:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:28:19,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-02 01:28:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:19,470 INFO L225 Difference]: With dead ends: 1546 [2019-10-02 01:28:19,471 INFO L226 Difference]: Without dead ends: 1028 [2019-10-02 01:28:19,487 INFO L640 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-10-02 01:28:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-02 01:28:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-10-02 01:28:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-02 01:28:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-10-02 01:28:19,644 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 58 [2019-10-02 01:28:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:19,647 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-10-02 01:28:19,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:28:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-10-02 01:28:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 01:28:19,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:19,666 INFO L411 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, 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-10-02 01:28:19,667 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1221807989, now seen corresponding path program 1 times [2019-10-02 01:28:19,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:19,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:19,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:28:19,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:28:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:28:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:28:19,873 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-10-02 01:28:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:23,730 INFO L93 Difference]: Finished difference Result 2057 states and 3297 transitions. [2019-10-02 01:28:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:28:23,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-02 01:28:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:23,746 INFO L225 Difference]: With dead ends: 2057 [2019-10-02 01:28:23,746 INFO L226 Difference]: Without dead ends: 1363 [2019-10-02 01:28:23,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:28:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-10-02 01:28:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-10-02 01:28:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-02 01:28:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-10-02 01:28:23,795 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 130 [2019-10-02 01:28:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:23,796 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-10-02 01:28:23,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:28:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-10-02 01:28:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 01:28:23,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:23,799 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:28:23,799 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash -78025861, now seen corresponding path program 1 times [2019-10-02 01:28:23,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:23,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:23,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:23,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:23,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:28:23,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:28:23,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:28:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:28:23,942 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 4 states. [2019-10-02 01:28:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:28,876 INFO L93 Difference]: Finished difference Result 5149 states and 7300 transitions. [2019-10-02 01:28:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:28:28,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 01:28:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:28,898 INFO L225 Difference]: With dead ends: 5149 [2019-10-02 01:28:28,898 INFO L226 Difference]: Without dead ends: 3822 [2019-10-02 01:28:28,903 INFO L640 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-10-02 01:28:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-10-02 01:28:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3819. [2019-10-02 01:28:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3819 states. [2019-10-02 01:28:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4957 transitions. [2019-10-02 01:28:28,998 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4957 transitions. Word has length 138 [2019-10-02 01:28:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:28,999 INFO L475 AbstractCegarLoop]: Abstraction has 3819 states and 4957 transitions. [2019-10-02 01:28:28,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:28:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4957 transitions. [2019-10-02 01:28:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 01:28:29,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:29,001 INFO L411 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, 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] [2019-10-02 01:28:29,002 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 90955185, now seen corresponding path program 1 times [2019-10-02 01:28:29,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:29,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:29,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:28:29,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:28:29,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:28:29,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:28:29,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:28:29,160 INFO L87 Difference]: Start difference. First operand 3819 states and 4957 transitions. Second operand 6 states. [2019-10-02 01:28:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:32,045 INFO L93 Difference]: Finished difference Result 7712 states and 10087 transitions. [2019-10-02 01:28:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:28:32,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 01:28:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:32,068 INFO L225 Difference]: With dead ends: 7712 [2019-10-02 01:28:32,068 INFO L226 Difference]: Without dead ends: 3899 [2019-10-02 01:28:32,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:28:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-10-02 01:28:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3889. [2019-10-02 01:28:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-10-02 01:28:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 4912 transitions. [2019-10-02 01:28:32,176 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 4912 transitions. Word has length 144 [2019-10-02 01:28:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:32,177 INFO L475 AbstractCegarLoop]: Abstraction has 3889 states and 4912 transitions. [2019-10-02 01:28:32,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:28:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 4912 transitions. [2019-10-02 01:28:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 01:28:32,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:32,179 INFO L411 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, 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] [2019-10-02 01:28:32,179 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2025648949, now seen corresponding path program 1 times [2019-10-02 01:28:32,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:32,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:32,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:32,532 INFO L224 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-10-02 01:28:32,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:32,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:28:32,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:32,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:28:32,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-10-02 01:28:32,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:28:32,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:28:32,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:28:32,762 INFO L87 Difference]: Start difference. First operand 3889 states and 4912 transitions. Second operand 11 states. [2019-10-02 01:28:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:28:54,979 INFO L93 Difference]: Finished difference Result 25083 states and 34943 transitions. [2019-10-02 01:28:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-02 01:28:54,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-10-02 01:28:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:28:55,102 INFO L225 Difference]: With dead ends: 25083 [2019-10-02 01:28:55,102 INFO L226 Difference]: Without dead ends: 21200 [2019-10-02 01:28:55,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 01:28:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21200 states. [2019-10-02 01:28:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21200 to 16210. [2019-10-02 01:28:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16210 states. [2019-10-02 01:28:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16210 states to 16210 states and 22424 transitions. [2019-10-02 01:28:55,798 INFO L78 Accepts]: Start accepts. Automaton has 16210 states and 22424 transitions. Word has length 169 [2019-10-02 01:28:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:28:55,799 INFO L475 AbstractCegarLoop]: Abstraction has 16210 states and 22424 transitions. [2019-10-02 01:28:55,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:28:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 16210 states and 22424 transitions. [2019-10-02 01:28:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 01:28:55,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:28:55,805 INFO L411 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, 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] [2019-10-02 01:28:55,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:28:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:28:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2087011701, now seen corresponding path program 1 times [2019-10-02 01:28:55,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:28:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:28:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:55,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:28:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 128 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:28:56,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:28:56,413 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:28:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:28:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:28:56,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 01:28:56,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:28:56,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:28:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:28:56,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:28:56,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-10-02 01:28:56,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:28:56,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:28:56,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:28:56,739 INFO L87 Difference]: Start difference. First operand 16210 states and 22424 transitions. Second operand 11 states. [2019-10-02 01:29:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:13,014 INFO L93 Difference]: Finished difference Result 47538 states and 67249 transitions. [2019-10-02 01:29:13,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 01:29:13,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2019-10-02 01:29:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:13,153 INFO L225 Difference]: With dead ends: 47538 [2019-10-02 01:29:13,153 INFO L226 Difference]: Without dead ends: 31641 [2019-10-02 01:29:13,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 01:29:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31641 states. [2019-10-02 01:29:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31641 to 26329. [2019-10-02 01:29:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26329 states. [2019-10-02 01:29:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26329 states to 26329 states and 37266 transitions. [2019-10-02 01:29:14,832 INFO L78 Accepts]: Start accepts. Automaton has 26329 states and 37266 transitions. Word has length 244 [2019-10-02 01:29:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:14,834 INFO L475 AbstractCegarLoop]: Abstraction has 26329 states and 37266 transitions. [2019-10-02 01:29:14,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:29:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 26329 states and 37266 transitions. [2019-10-02 01:29:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 01:29:14,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:14,854 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:29:14,855 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:14,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash -478575890, now seen corresponding path program 1 times [2019-10-02 01:29:14,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:14,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:14,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:14,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:14,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 01:29:15,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:29:15,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:29:15,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:29:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:29:15,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:29:15,191 INFO L87 Difference]: Start difference. First operand 26329 states and 37266 transitions. Second operand 3 states. [2019-10-02 01:29:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:18,228 INFO L93 Difference]: Finished difference Result 59145 states and 83955 transitions. [2019-10-02 01:29:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:29:18,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-10-02 01:29:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:18,335 INFO L225 Difference]: With dead ends: 59145 [2019-10-02 01:29:18,336 INFO L226 Difference]: Without dead ends: 33129 [2019-10-02 01:29:18,403 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:29:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33129 states. [2019-10-02 01:29:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33129 to 29433. [2019-10-02 01:29:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29433 states. [2019-10-02 01:29:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29433 states to 29433 states and 40962 transitions. [2019-10-02 01:29:19,100 INFO L78 Accepts]: Start accepts. Automaton has 29433 states and 40962 transitions. Word has length 353 [2019-10-02 01:29:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:19,101 INFO L475 AbstractCegarLoop]: Abstraction has 29433 states and 40962 transitions. [2019-10-02 01:29:19,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:29:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 29433 states and 40962 transitions. [2019-10-02 01:29:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 01:29:19,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:19,117 INFO L411 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, 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, 1, 1, 1, 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-10-02 01:29:19,118 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 56090557, now seen corresponding path program 1 times [2019-10-02 01:29:19,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:19,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:19,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 340 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 01:29:19,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:19,590 INFO L224 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-10-02 01:29:19,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:19,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:29:19,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 340 proven. 2 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 01:29:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:19,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:29:19,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:29:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:29:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:29:19,831 INFO L87 Difference]: Start difference. First operand 29433 states and 40962 transitions. Second operand 9 states. [2019-10-02 01:29:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:29:28,447 INFO L93 Difference]: Finished difference Result 71263 states and 110880 transitions. [2019-10-02 01:29:28,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 01:29:28,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2019-10-02 01:29:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:29:28,643 INFO L225 Difference]: With dead ends: 71263 [2019-10-02 01:29:28,643 INFO L226 Difference]: Without dead ends: 42143 [2019-10-02 01:29:28,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:29:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42143 states. [2019-10-02 01:29:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42143 to 40456. [2019-10-02 01:29:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-10-02 01:29:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 57378 transitions. [2019-10-02 01:29:29,812 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 57378 transitions. Word has length 357 [2019-10-02 01:29:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:29:29,812 INFO L475 AbstractCegarLoop]: Abstraction has 40456 states and 57378 transitions. [2019-10-02 01:29:29,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:29:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 57378 transitions. [2019-10-02 01:29:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-10-02 01:29:29,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:29:29,844 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:29:29,844 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:29:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:29:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash 338745054, now seen corresponding path program 1 times [2019-10-02 01:29:29,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:29:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:29:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:29,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:29:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 382 proven. 368 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:29:32,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:29:32,222 INFO L224 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-10-02 01:29:32,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:29:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:29:32,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 01:29:32,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:29:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:29:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:29:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 518 proven. 41 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 01:29:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:29:32,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 25 [2019-10-02 01:29:32,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 01:29:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 01:29:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-10-02 01:29:32,807 INFO L87 Difference]: Start difference. First operand 40456 states and 57378 transitions. Second operand 25 states. [2019-10-02 01:30:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:30:21,723 INFO L93 Difference]: Finished difference Result 102815 states and 170405 transitions. [2019-10-02 01:30:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-10-02 01:30:21,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 448 [2019-10-02 01:30:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:30:22,092 INFO L225 Difference]: With dead ends: 102815 [2019-10-02 01:30:22,092 INFO L226 Difference]: Without dead ends: 59967 [2019-10-02 01:30:22,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16497 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=4516, Invalid=36490, Unknown=0, NotChecked=0, Total=41006 [2019-10-02 01:30:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59967 states. [2019-10-02 01:30:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59967 to 50841. [2019-10-02 01:30:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50841 states. [2019-10-02 01:30:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50841 states to 50841 states and 70568 transitions. [2019-10-02 01:30:26,622 INFO L78 Accepts]: Start accepts. Automaton has 50841 states and 70568 transitions. Word has length 448 [2019-10-02 01:30:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:30:26,623 INFO L475 AbstractCegarLoop]: Abstraction has 50841 states and 70568 transitions. [2019-10-02 01:30:26,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 01:30:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 50841 states and 70568 transitions. [2019-10-02 01:30:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-10-02 01:30:26,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:30:26,664 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:30:26,664 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:30:26,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:30:26,666 INFO L82 PathProgramCache]: Analyzing trace with hash -991690859, now seen corresponding path program 1 times [2019-10-02 01:30:26,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:30:26,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:30:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:26,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:26,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:30:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 382 proven. 384 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 01:30:28,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:30:28,065 INFO L224 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-10-02 01:30:28,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:30:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:30:28,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 01:30:28,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:30:28,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:30:28,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:30:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 518 proven. 57 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 01:30:28,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:30:28,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 28 [2019-10-02 01:30:28,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 01:30:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 01:30:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-10-02 01:30:28,877 INFO L87 Difference]: Start difference. First operand 50841 states and 70568 transitions. Second operand 28 states. [2019-10-02 01:30:34,125 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-10-02 01:30:35,535 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-02 01:30:37,225 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-02 01:30:45,422 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-10-02 01:30:46,650 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-02 01:30:50,072 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-02 01:30:51,763 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-02 01:30:59,036 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 01:30:59,837 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-02 01:31:07,262 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-10-02 01:31:18,075 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 01:31:26,636 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 01:31:27,025 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-02 01:31:28,740 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2019-10-02 01:31:29,131 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-02 01:31:35,024 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-10-02 01:31:36,501 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-02 01:31:37,832 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-02 01:31:41,733 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-02 01:31:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:53,207 INFO L93 Difference]: Finished difference Result 135072 states and 207960 transitions. [2019-10-02 01:31:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2019-10-02 01:31:53,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 533 [2019-10-02 01:31:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:53,653 INFO L225 Difference]: With dead ends: 135072 [2019-10-02 01:31:53,653 INFO L226 Difference]: Without dead ends: 80505 [2019-10-02 01:31:53,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34195 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=8523, Invalid=71283, Unknown=0, NotChecked=0, Total=79806 [2019-10-02 01:31:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80505 states. [2019-10-02 01:31:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80505 to 64842. [2019-10-02 01:31:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64842 states. [2019-10-02 01:31:56,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64842 states to 64842 states and 88274 transitions. [2019-10-02 01:31:56,216 INFO L78 Accepts]: Start accepts. Automaton has 64842 states and 88274 transitions. Word has length 533 [2019-10-02 01:31:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:56,216 INFO L475 AbstractCegarLoop]: Abstraction has 64842 states and 88274 transitions. [2019-10-02 01:31:56,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 01:31:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 64842 states and 88274 transitions. [2019-10-02 01:31:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-10-02 01:31:56,255 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:56,256 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:31:56,256 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1630988821, now seen corresponding path program 1 times [2019-10-02 01:31:56,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:56,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:56,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:56,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 212 proven. 547 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 01:31:58,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:58,142 INFO L224 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-10-02 01:31:58,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:58,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:31:58,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:58,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:31:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 573 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 01:31:58,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:31:58,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 5] total 23 [2019-10-02 01:31:58,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 01:31:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 01:31:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-10-02 01:31:58,546 INFO L87 Difference]: Start difference. First operand 64842 states and 88274 transitions. Second operand 23 states. [2019-10-02 01:32:09,381 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2019-10-02 01:32:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:32:42,281 INFO L93 Difference]: Finished difference Result 169088 states and 229946 transitions. [2019-10-02 01:32:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-10-02 01:32:42,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 590 [2019-10-02 01:32:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:32:42,529 INFO L225 Difference]: With dead ends: 169088 [2019-10-02 01:32:42,530 INFO L226 Difference]: Without dead ends: 98442 [2019-10-02 01:32:42,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7640 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2852, Invalid=18028, Unknown=0, NotChecked=0, Total=20880 [2019-10-02 01:32:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98442 states. [2019-10-02 01:32:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98442 to 79554. [2019-10-02 01:32:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79554 states. [2019-10-02 01:32:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79554 states to 79554 states and 93767 transitions. [2019-10-02 01:32:44,386 INFO L78 Accepts]: Start accepts. Automaton has 79554 states and 93767 transitions. Word has length 590 [2019-10-02 01:32:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:32:44,387 INFO L475 AbstractCegarLoop]: Abstraction has 79554 states and 93767 transitions. [2019-10-02 01:32:44,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 01:32:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 79554 states and 93767 transitions. [2019-10-02 01:32:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2019-10-02 01:32:44,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:32:44,408 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:32:44,409 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:32:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:32:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1032492813, now seen corresponding path program 1 times [2019-10-02 01:32:44,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:32:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:32:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:32:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 383 proven. 277 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 01:32:45,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:32:45,255 INFO L224 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-10-02 01:32:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:32:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:32:45,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:32:45,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:32:45,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:32:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 483 proven. 2 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-10-02 01:32:45,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:45,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:32:45,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:32:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:32:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:32:45,856 INFO L87 Difference]: Start difference. First operand 79554 states and 93767 transitions. Second operand 18 states. [2019-10-02 01:33:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:50,577 INFO L93 Difference]: Finished difference Result 189806 states and 231150 transitions. [2019-10-02 01:33:50,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2019-10-02 01:33:50,578 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 627 [2019-10-02 01:33:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:50,881 INFO L225 Difference]: With dead ends: 189806 [2019-10-02 01:33:50,881 INFO L226 Difference]: Without dead ends: 92501 [2019-10-02 01:33:51,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2160, Invalid=18432, Unknown=0, NotChecked=0, Total=20592 [2019-10-02 01:33:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92501 states. [2019-10-02 01:33:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92501 to 82036. [2019-10-02 01:33:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82036 states. [2019-10-02 01:33:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82036 states to 82036 states and 90210 transitions. [2019-10-02 01:33:54,450 INFO L78 Accepts]: Start accepts. Automaton has 82036 states and 90210 transitions. Word has length 627 [2019-10-02 01:33:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:54,450 INFO L475 AbstractCegarLoop]: Abstraction has 82036 states and 90210 transitions. [2019-10-02 01:33:54,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:33:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 82036 states and 90210 transitions. [2019-10-02 01:33:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-10-02 01:33:54,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:54,461 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:33:54,461 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -750150956, now seen corresponding path program 1 times [2019-10-02 01:33:54,461 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:54,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:54,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-10-02 01:33:54,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:54,857 INFO L224 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-10-02 01:33:54,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:55,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:33:55,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-10-02 01:33:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:33:55,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 01:33:55,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:33:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:33:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:33:55,251 INFO L87 Difference]: Start difference. First operand 82036 states and 90210 transitions. Second operand 3 states. [2019-10-02 01:33:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:57,509 INFO L93 Difference]: Finished difference Result 150208 states and 165101 transitions. [2019-10-02 01:33:57,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:33:57,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 638 [2019-10-02 01:33:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:57,654 INFO L225 Difference]: With dead ends: 150208 [2019-10-02 01:33:57,654 INFO L226 Difference]: Without dead ends: 81778 [2019-10-02 01:33:57,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:33:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81778 states. [2019-10-02 01:33:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81778 to 79310. [2019-10-02 01:33:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79310 states. [2019-10-02 01:33:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79310 states to 79310 states and 86433 transitions. [2019-10-02 01:33:58,613 INFO L78 Accepts]: Start accepts. Automaton has 79310 states and 86433 transitions. Word has length 638 [2019-10-02 01:33:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:58,613 INFO L475 AbstractCegarLoop]: Abstraction has 79310 states and 86433 transitions. [2019-10-02 01:33:58,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:33:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 79310 states and 86433 transitions. [2019-10-02 01:33:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-10-02 01:33:58,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:58,630 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:33:58,630 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1840128562, now seen corresponding path program 1 times [2019-10-02 01:33:58,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:58,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:58,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 730 proven. 114 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 01:34:01,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:34:01,258 INFO L224 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-10-02 01:34:01,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:34:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:34:01,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:34:01,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:34:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:02,455 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 299978))) (and (<= c_~a29~0 (+ .cse0 43)) (not (= 0 .cse0)) (< v_prenex_2 0)))) (exists ((v_~a29~0_906 Int)) (let ((.cse1 (mod v_~a29~0_906 299978))) (and (<= c_~a29~0 (+ .cse1 300021)) (= 0 .cse1)))) (exists ((v_~a29~0_906 Int)) (and (<= 0 v_~a29~0_906) (<= c_~a29~0 (+ (mod v_~a29~0_906 299978) 300021))))) is different from true [2019-10-02 01:34:03,036 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 299978))) (and (<= c_~a29~0 (+ .cse0 43)) (not (= 0 .cse0)) (< v_prenex_2 0)))) (exists ((v_~a29~0_906 Int)) (let ((.cse1 (mod v_~a29~0_906 299978))) (and (<= c_~a29~0 (+ .cse1 300021)) (= 0 .cse1)))) (exists ((v_prenex_3 Int)) (and (<= 0 v_prenex_3) (<= c_~a29~0 (+ (mod v_prenex_3 299978) 300021))))) is different from true [2019-10-02 01:34:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:03,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:03,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:34:03,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:03,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:03,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:34:08,598 WARN L191 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 58 DAG size of output: 21 [2019-10-02 01:34:08,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 01:34:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 474 proven. 48 refuted. 0 times theorem prover too weak. 424 trivial. 6 not checked. [2019-10-02 01:34:09,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:34:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-10-02 01:34:09,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:34:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:34:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=176, Unknown=3, NotChecked=54, Total=272 [2019-10-02 01:34:09,025 INFO L87 Difference]: Start difference. First operand 79310 states and 86433 transitions. Second operand 17 states. [2019-10-02 01:34:54,701 WARN L191 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-10-02 01:34:56,333 WARN L191 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-10-02 01:35:38,998 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 01:35:44,135 WARN L191 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 01:35:50,521 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 01:36:41,591 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-10-02 01:36:45,777 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 01:39:38,913 WARN L191 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-10-02 01:39:50,789 WARN L191 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 01:40:09,420 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-02 01:40:50,427 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-10-02 01:40:55,354 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-10-02 01:41:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:41:31,807 INFO L93 Difference]: Finished difference Result 160104 states and 174159 transitions. [2019-10-02 01:41:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-02 01:41:31,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 759 [2019-10-02 01:41:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:41:32,011 INFO L225 Difference]: With dead ends: 160104 [2019-10-02 01:41:32,012 INFO L226 Difference]: Without dead ends: 94400 [2019-10-02 01:41:32,091 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 806 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2441 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=1122, Invalid=5343, Unknown=23, NotChecked=318, Total=6806 [2019-10-02 01:41:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94400 states. [2019-10-02 01:41:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94400 to 88668. [2019-10-02 01:41:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88668 states. [2019-10-02 01:41:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88668 states to 88668 states and 96802 transitions. [2019-10-02 01:41:33,147 INFO L78 Accepts]: Start accepts. Automaton has 88668 states and 96802 transitions. Word has length 759 [2019-10-02 01:41:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:41:33,148 INFO L475 AbstractCegarLoop]: Abstraction has 88668 states and 96802 transitions. [2019-10-02 01:41:33,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:41:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 88668 states and 96802 transitions. [2019-10-02 01:41:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2019-10-02 01:41:33,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:41:33,174 INFO L411 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:41:33,174 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:41:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:41:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash 311523789, now seen corresponding path program 1 times [2019-10-02 01:41:33,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:41:33,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:41:33,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:41:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:41:33,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:41:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:41:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 276 proven. 2 refuted. 0 times theorem prover too weak. 1094 trivial. 0 not checked. [2019-10-02 01:41:33,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:41:33,900 INFO L224 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-10-02 01:41:33,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:41:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:41:34,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 01:41:34,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:41:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1372 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2019-10-02 01:41:34,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:41:34,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-10-02 01:41:34,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:41:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:41:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:41:34,408 INFO L87 Difference]: Start difference. First operand 88668 states and 96802 transitions. Second operand 3 states. [2019-10-02 01:41:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:41:36,955 INFO L93 Difference]: Finished difference Result 176681 states and 192905 transitions. [2019-10-02 01:41:36,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:41:36,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 830 [2019-10-02 01:41:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:41:37,104 INFO L225 Difference]: With dead ends: 176681 [2019-10-02 01:41:37,104 INFO L226 Difference]: Without dead ends: 88633 [2019-10-02 01:41:37,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:41:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88633 states. [2019-10-02 01:41:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88633 to 86472. [2019-10-02 01:41:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86472 states. [2019-10-02 01:41:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86472 states to 86472 states and 94352 transitions. [2019-10-02 01:41:38,105 INFO L78 Accepts]: Start accepts. Automaton has 86472 states and 94352 transitions. Word has length 830 [2019-10-02 01:41:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:41:38,105 INFO L475 AbstractCegarLoop]: Abstraction has 86472 states and 94352 transitions. [2019-10-02 01:41:38,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:41:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 86472 states and 94352 transitions. [2019-10-02 01:41:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2019-10-02 01:41:38,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:41:38,184 INFO L411 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:41:38,184 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:41:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:41:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1546758620, now seen corresponding path program 1 times [2019-10-02 01:41:38,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:41:38,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:41:38,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:41:38,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:41:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:41:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:41:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2129 backedges. 689 proven. 1173 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-02 01:41:40,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:41:40,924 INFO L224 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-10-02 01:41:40,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:41:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:41:41,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:41:41,564 INFO L279 TraceCheckSpWp]: Computing forward predicates...