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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive/Primes.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:37,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:37,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:37,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:37,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:37,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:37,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:37,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:37,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:37,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:37,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:37,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:37,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:37,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:37,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:37,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:37,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:37,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:37,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:37,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:37,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:37,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:37,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:37,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:37,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:37,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:37,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:37,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:37,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:37,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:37,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:37,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:37,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:37,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:37,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:37,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:37,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:37,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:37,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:37,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:37,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:37,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:51:37,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:37,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:37,703 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:37,703 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:37,703 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:37,704 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:37,704 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:37,704 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:37,704 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:37,704 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:37,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:37,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:37,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:37,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:37,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:37,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:37,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:37,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:37,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:37,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:37,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:37,707 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:37,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:37,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:37,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:37,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:37,708 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:37,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:37,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:37,709 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:37,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:37,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:37,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:37,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:37,755 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:37,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Primes.c [2019-09-10 02:51:37,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8b55d43/9e21e4c5e76c478c8786a1ced9d4be69/FLAGa3b2b51e7 [2019-09-10 02:51:38,270 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:38,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Primes.c [2019-09-10 02:51:38,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8b55d43/9e21e4c5e76c478c8786a1ced9d4be69/FLAGa3b2b51e7 [2019-09-10 02:51:38,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b8b55d43/9e21e4c5e76c478c8786a1ced9d4be69 [2019-09-10 02:51:38,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:38,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:38,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:38,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:38,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:38,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:38" (1/1) ... [2019-09-10 02:51:38,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298ecca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:38, skipping insertion in model container [2019-09-10 02:51:38,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:38" (1/1) ... [2019-09-10 02:51:38,681 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:38,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:38,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:38,885 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:38,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:39,010 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:39,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39 WrapperNode [2019-09-10 02:51:39,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:39,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:39,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:39,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:39,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... [2019-09-10 02:51:39,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:39,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:39,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:39,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:39,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:39,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:39,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:39,099 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-09-10 02:51:39,099 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-09-10 02:51:39,100 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2019-09-10 02:51:39,100 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-09-10 02:51:39,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-09-10 02:51:39,100 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-09-10 02:51:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-09-10 02:51:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2019-09-10 02:51:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:39,452 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:39,452 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:39,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:39 BoogieIcfgContainer [2019-09-10 02:51:39,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:39,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:39,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:39,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:39,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:38" (1/3) ... [2019-09-10 02:51:39,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f53b6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:39, skipping insertion in model container [2019-09-10 02:51:39,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:39" (2/3) ... [2019-09-10 02:51:39,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f53b6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:39, skipping insertion in model container [2019-09-10 02:51:39,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:39" (3/3) ... [2019-09-10 02:51:39,460 INFO L109 eAbstractionObserver]: Analyzing ICFG Primes.c [2019-09-10 02:51:39,469 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:39,480 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:39,500 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:39,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:39,526 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:39,526 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:39,526 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:39,526 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:39,526 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:39,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:39,526 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-09-10 02:51:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:51:39,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:39,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:39,556 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1011403708, now seen corresponding path program 1 times [2019-09-10 02:51:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:39,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:51:39,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:39,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:51:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:51:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:51:39,736 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-09-10 02:51:39,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:39,787 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2019-09-10 02:51:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:51:39,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-10 02:51:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:39,799 INFO L225 Difference]: With dead ends: 61 [2019-09-10 02:51:39,800 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 02:51:39,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:51:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 02:51:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-09-10 02:51:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 02:51:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2019-09-10 02:51:39,846 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 22 [2019-09-10 02:51:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:39,848 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2019-09-10 02:51:39,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:51:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2019-09-10 02:51:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 02:51:39,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:39,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:39,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:39,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2066239412, now seen corresponding path program 1 times [2019-09-10 02:51:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:39,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:51:39,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:39,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:51:39,993 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 8 states. [2019-09-10 02:51:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,066 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-09-10 02:51:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:51:40,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-09-10 02:51:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,072 INFO L225 Difference]: With dead ends: 65 [2019-09-10 02:51:40,072 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:51:40,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:51:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:51:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-10 02:51:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:51:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-09-10 02:51:40,088 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 29 [2019-09-10 02:51:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,088 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-09-10 02:51:40,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-09-10 02:51:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 02:51:40,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:40,093 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 925502914, now seen corresponding path program 1 times [2019-09-10 02:51:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:40,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:40,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:40,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:40,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:40,208 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 5 states. [2019-09-10 02:51:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,291 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2019-09-10 02:51:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:40,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-10 02:51:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,295 INFO L225 Difference]: With dead ends: 62 [2019-09-10 02:51:40,295 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 02:51:40,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 02:51:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-09-10 02:51:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:51:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-09-10 02:51:40,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 30 [2019-09-10 02:51:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,316 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-09-10 02:51:40,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2019-09-10 02:51:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 02:51:40,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:40,322 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash -680413659, now seen corresponding path program 1 times [2019-09-10 02:51:40,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:51:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:40,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:40,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:40,422 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 5 states. [2019-09-10 02:51:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,502 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-09-10 02:51:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:40,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-09-10 02:51:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,505 INFO L225 Difference]: With dead ends: 64 [2019-09-10 02:51:40,505 INFO L226 Difference]: Without dead ends: 62 [2019-09-10 02:51:40,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:51:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-10 02:51:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-09-10 02:51:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:51:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-09-10 02:51:40,515 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 31 [2019-09-10 02:51:40,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,516 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-09-10 02:51:40,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2019-09-10 02:51:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 02:51:40,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,518 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:51:40,519 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1918898322, now seen corresponding path program 1 times [2019-09-10 02:51:40,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:40,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:40,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:40,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2019-09-10 02:51:40,633 INFO L207 CegarAbsIntRunner]: [24], [25], [31], [34], [35], [39], [41], [42], [46], [50], [53], [71], [72], [76], [78], [82], [86], [89], [91], [97], [99], [104], [106], [107], [116], [117], [118], [119], [120], [126], [127], [128], [129], [130], [131] [2019-09-10 02:51:40,668 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:40,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:40,764 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:51:40,765 INFO L272 AbstractInterpreter]: Visited 28 different actions 46 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 5. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2019-09-10 02:51:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,769 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:51:40,829 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 57.5% of their original sizes. [2019-09-10 02:51:40,829 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:51:41,112 INFO L420 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2019-09-10 02:51:41,114 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:51:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:51:41,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [7] total 27 [2019-09-10 02:51:41,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:41,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:51:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:51:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:51:41,117 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand 22 states. [2019-09-10 02:51:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:42,659 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2019-09-10 02:51:42,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:51:42,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-09-10 02:51:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:42,663 INFO L225 Difference]: With dead ends: 114 [2019-09-10 02:51:42,664 INFO L226 Difference]: Without dead ends: 108 [2019-09-10 02:51:42,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:51:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-10 02:51:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2019-09-10 02:51:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 02:51:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2019-09-10 02:51:42,687 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 38 [2019-09-10 02:51:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:42,690 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2019-09-10 02:51:42,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:51:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2019-09-10 02:51:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 02:51:42,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:42,695 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:51:42,696 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1144159485, now seen corresponding path program 1 times [2019-09-10 02:51:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:42,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:42,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:42,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2019-09-10 02:51:42,856 INFO L207 CegarAbsIntRunner]: [24], [25], [31], [35], [38], [39], [41], [42], [46], [50], [53], [71], [72], [76], [78], [82], [86], [89], [91], [97], [99], [104], [106], [107], [116], [117], [118], [119], [120], [126], [127], [128], [129], [130], [131] [2019-09-10 02:51:42,859 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:42,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:42,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:42,892 INFO L272 AbstractInterpreter]: Visited 35 different actions 81 times. Merged at 5 different actions 21 times. Never widened. Performed 116 root evaluator evaluations with a maximum evaluation depth of 5. Performed 116 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 2 different actions. Largest state had 10 variables. [2019-09-10 02:51:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:42,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:42,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:42,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:42,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:42,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:51:42,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:43,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 02:51:43,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:43,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 02:51:43,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:43,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-09-10 02:51:43,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:43,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:51:43,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:51:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:51:43,472 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand 15 states. [2019-09-10 02:51:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,822 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2019-09-10 02:51:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:51:43,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-09-10 02:51:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,824 INFO L225 Difference]: With dead ends: 139 [2019-09-10 02:51:43,825 INFO L226 Difference]: Without dead ends: 137 [2019-09-10 02:51:43,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2019-09-10 02:51:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-10 02:51:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2019-09-10 02:51:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-10 02:51:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2019-09-10 02:51:43,862 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 39 [2019-09-10 02:51:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,862 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2019-09-10 02:51:43,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:51:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2019-09-10 02:51:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:51:43,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,865 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 02:51:43,865 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -885721633, now seen corresponding path program 1 times [2019-09-10 02:51:43,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:51:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:51:43,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:43,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:51:43,951 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand 7 states. [2019-09-10 02:51:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:44,010 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2019-09-10 02:51:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:44,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-10 02:51:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:44,012 INFO L225 Difference]: With dead ends: 128 [2019-09-10 02:51:44,012 INFO L226 Difference]: Without dead ends: 123 [2019-09-10 02:51:44,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:51:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-10 02:51:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-09-10 02:51:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-10 02:51:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2019-09-10 02:51:44,026 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 41 [2019-09-10 02:51:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:44,026 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2019-09-10 02:51:44,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2019-09-10 02:51:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-10 02:51:44,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:44,028 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-10 02:51:44,028 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 85935973, now seen corresponding path program 2 times [2019-09-10 02:51:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:44,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:51:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:44,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:44,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:44,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:44,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:44,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:44,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:44,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 02:51:44,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:44,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 02:51:44,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:46,594 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-10 02:51:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 02:51:46,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:47,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:08,982 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-10 02:52:43,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-09-10 02:52:46,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 4 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:52:46,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:46,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 33 [2019-09-10 02:52:46,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:46,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:52:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:52:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=927, Unknown=24, NotChecked=0, Total=1056 [2019-09-10 02:52:46,115 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 19 states. [2019-09-10 02:52:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:50,822 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2019-09-10 02:52:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:52:50,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-09-10 02:52:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:50,825 INFO L225 Difference]: With dead ends: 135 [2019-09-10 02:52:50,826 INFO L226 Difference]: Without dead ends: 130 [2019-09-10 02:52:50,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=150, Invalid=1306, Unknown=26, NotChecked=0, Total=1482 [2019-09-10 02:52:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-10 02:52:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2019-09-10 02:52:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-10 02:52:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2019-09-10 02:52:50,837 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 47 [2019-09-10 02:52:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:50,838 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2019-09-10 02:52:50,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:52:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2019-09-10 02:52:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 02:52:50,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:50,839 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:50,840 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:50,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash 911848899, now seen corresponding path program 3 times [2019-09-10 02:52:50,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:50,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:50,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:52:51,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:51,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:51,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:51,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:51,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:51,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:52:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:52:51,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:52:51,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:52:51,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:52:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 02:52:51,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:52:54,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:52:54,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:52:54,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:52:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 30 [2019-09-10 02:52:55,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:55,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-10 02:52:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-10 02:52:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=790, Unknown=2, NotChecked=0, Total=870 [2019-09-10 02:52:55,241 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand 24 states. [2019-09-10 02:52:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:58,105 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2019-09-10 02:52:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:52:58,107 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2019-09-10 02:52:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:58,109 INFO L225 Difference]: With dead ends: 141 [2019-09-10 02:52:58,109 INFO L226 Difference]: Without dead ends: 136 [2019-09-10 02:52:58,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 14 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=127, Invalid=1277, Unknown=2, NotChecked=0, Total=1406 [2019-09-10 02:52:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-10 02:52:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2019-09-10 02:52:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-10 02:52:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2019-09-10 02:52:58,121 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 55 [2019-09-10 02:52:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:58,121 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2019-09-10 02:52:58,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-10 02:52:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2019-09-10 02:52:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 02:52:58,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:58,123 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:58,123 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash -966039387, now seen corresponding path program 4 times [2019-09-10 02:52:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:58,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:52:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:58,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:52:58,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:58,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:52:58,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:52:58,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:52:58,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:52:58,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:52:58,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:58,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:52:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:52:58,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 02:52:58,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:53:01,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 02:53:01,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:53:01,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:53:26,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~f1~0_BEFORE_CALL_6 Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |c_mult_#t~ret1|)) (< |c_mult_#in~n| v_main_~f1~0_BEFORE_CALL_6))) is different from false [2019-09-10 02:53:29,574 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 66 [2019-09-10 02:53:29,705 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-09-10 02:53:31,927 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 58 [2019-09-10 02:53:34,056 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-10 02:53:36,405 WARN L188 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 02:53:38,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_mult_#t~ret1_183| Int) (v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#res_191| Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |v_mult_#res_191| 1) (< (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3)) (+ c_mult_~n 1)) (< |c_mult_#in~n| v_main_~f1~0_BEFORE_CALL_6) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |v_mult_#t~ret1_183|)))) is different from false [2019-09-10 02:53:38,458 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-09-10 02:53:40,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< v_main_~n~0_BEFORE_CALL_11 (+ v_mult_~n_BEFORE_CALL_17 |c_mult_#res|)) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_17) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6))) is different from false [2019-09-10 02:53:41,571 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-09-10 02:53:41,580 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-09-10 02:53:43,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_17) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |c_mult_#t~ret1| v_mult_~n_BEFORE_CALL_17)) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6))) is different from false [2019-09-10 02:53:59,266 WARN L188 SmtUtils]: Spent 15.49 s on a formula simplification that was a NOOP. DAG size: 85 [2019-09-10 02:53:59,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2019-09-10 02:54:01,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (|v_mult_#t~ret1_201| Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2)) (+ c_mult_~n 1)) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_17) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |v_mult_#t~ret1_201| v_mult_~n_BEFORE_CALL_17)) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6))) is different from false [2019-09-10 02:54:03,310 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (|v_mult_#t~ret1_201| Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2)) (+ c_mult_~n 1)) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_17) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |v_mult_#t~ret1_201| v_mult_~n_BEFORE_CALL_17)) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6))) is different from true [2019-09-10 02:54:03,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2019-09-10 02:54:03,607 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-09-10 02:54:04,595 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 12526 conjuctions. This might take some time... [2019-09-10 02:54:04,668 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 8 conjuctions. [2019-09-10 02:54:06,706 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< v_main_~n~0_BEFORE_CALL_11 (+ v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17 |c_mult_#res|)) (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from false [2019-09-10 02:54:08,743 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< v_main_~n~0_BEFORE_CALL_11 (+ v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17 |c_mult_#res|)) (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from true [2019-09-10 02:54:08,749 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 02:54:08,792 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-09-10 02:54:08,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 02:54:08,888 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-09-10 02:54:10,966 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |c_mult_#t~ret1| v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17)) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from false [2019-09-10 02:54:13,043 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (< v_main_~n~0_BEFORE_CALL_11 (+ c_mult_~n |c_mult_#t~ret1| v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17)) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from true [2019-09-10 02:54:13,157 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-09-10 02:54:13,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-09-10 02:54:15,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< v_main_~n~0_BEFORE_CALL_11 (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17 1)) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from false [2019-09-10 02:54:17,565 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_mult_~n_BEFORE_CALL_18 Int) (v_mult_~n_BEFORE_CALL_17 Int) (v_main_~f1~0_BEFORE_CALL_6 Int) (|v_mult_#in~n_BEFORE_CALL_18| Int) (|v_mult_#in~n_BEFORE_CALL_17| Int)) (or (< |v_mult_#in~n_BEFORE_CALL_18| v_mult_~n_BEFORE_CALL_17) (exists ((v_mult_~n_126 Int) (|v_mult_#res_160| Int)) (and (<= (+ v_mult_~n_126 1) |v_mult_#res_160|) (<= v_main_~f1~0_BEFORE_CALL_6 v_mult_~n_126) (<= (+ v_main_~f1~0_BEFORE_CALL_6 1) (div (+ v_mult_~n_126 (* (- 1) v_main_~n~0_BEFORE_CALL_11) |v_mult_#res_160| (- 1)) (- 2))))) (< v_main_~n~0_BEFORE_CALL_11 (+ (* 2 c_mult_~n) v_mult_~n_BEFORE_CALL_18 v_mult_~n_BEFORE_CALL_17 1)) (< |c_mult_#in~n| v_mult_~n_BEFORE_CALL_18) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_mult_#t~ret1_183| Int) (|v_mult_#res_191| Int)) (and (<= v_prenex_7 |v_mult_#in~n_BEFORE_CALL_17|) (<= 1 |v_mult_#res_191|) (<= (+ |v_mult_#t~ret1_183| v_mult_~n_BEFORE_CALL_17) v_prenex_6) (forall ((v_prenex_8 Int) (v_prenex_9 Int)) (or (< v_prenex_9 (+ v_prenex_8 1)) (< (div (+ v_prenex_8 (* (- 1) v_prenex_6) v_prenex_9 (- 1)) (- 2)) (+ v_prenex_7 1)) (< v_prenex_8 v_prenex_7))) (<= (+ v_mult_~n_BEFORE_CALL_17 1) (div (+ (+ (- |v_mult_#t~ret1_183|) |v_mult_#res_191|) (- 1)) (- 3))))) (< |v_mult_#in~n_BEFORE_CALL_17| v_main_~f1~0_BEFORE_CALL_6) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (|v_mult_#t~ret1_201| Int) (v_prenex_10 Int)) (and (<= (+ v_mult_~n_BEFORE_CALL_18 1) (div (+ (+ (- |v_mult_#t~ret1_201|) 1) (- 1)) (- 2))) (<= (+ v_prenex_11 v_mult_~n_BEFORE_CALL_18 |v_mult_#t~ret1_201|) v_prenex_10) (<= v_prenex_12 v_prenex_13) (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (or (< (div (+ v_prenex_17 (* (- 1) v_prenex_10) v_prenex_18 (- 1)) (- 2)) (+ v_prenex_12 1)) (< v_prenex_17 v_prenex_12) (< v_prenex_18 (+ v_prenex_17 1)))) (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_14 Int) (v_prenex_19 Int)) (or (< v_prenex_19 1) (< (div (+ (+ (- v_prenex_14) v_prenex_19) (- 1)) (- 3)) (+ v_prenex_11 1)) (< v_prenex_13 v_prenex_16) (< v_prenex_15 (+ v_prenex_11 v_prenex_14)) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (and (<= (+ v_prenex_16 1) (div (+ v_prenex_20 (* (- 1) v_prenex_15) v_prenex_21 (- 1)) (- 2))) (<= (+ v_prenex_20 1) v_prenex_21) (<= v_prenex_16 v_prenex_20))))) (<= v_prenex_11 |v_mult_#in~n_BEFORE_CALL_18|))))) is different from true [2019-09-10 02:54:19,023 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 2760