java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/egcd.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:13:26,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:13:26,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:13:26,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:13:26,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:13:26,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:13:26,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:13:26,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:13:26,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:13:26,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:13:26,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:13:26,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:13:26,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:13:26,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:13:26,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:13:26,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:13:26,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:13:26,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:13:26,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:13:26,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:13:26,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:13:26,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:13:26,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:13:26,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:13:26,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:13:26,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:13:26,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:13:26,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:13:26,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:13:26,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:13:26,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:13:26,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:13:26,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:13:26,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:13:26,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:13:26,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:13:26,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:13:26,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:13:26,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:13:26,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:13:26,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:13:26,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:13:26,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:13:26,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:13:26,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:13:26,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:13:26,748 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:13:26,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:13:26,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:13:26,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:13:26,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:13:26,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:13:26,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:13:26,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:13:26,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:13:26,751 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:13:26,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:13:26,752 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:13:26,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:13:26,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:13:26,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:13:26,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:13:26,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:13:26,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:13:26,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:13:26,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:13:26,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:13:26,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:13:26,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:13:26,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:13:26,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:13:26,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:13:26,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:13:26,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:13:26,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:13:26,830 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:13:26,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-16 16:13:26,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697d52a72/7ed21b8b717446ba94958b7e276e6776/FLAG256ce7529 [2019-09-16 16:13:27,395 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:13:27,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd.c [2019-09-16 16:13:27,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697d52a72/7ed21b8b717446ba94958b7e276e6776/FLAG256ce7529 [2019-09-16 16:13:27,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697d52a72/7ed21b8b717446ba94958b7e276e6776 [2019-09-16 16:13:27,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:13:27,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:13:27,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:13:27,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:13:27,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:13:27,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:13:27" (1/1) ... [2019-09-16 16:13:27,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3c52bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:27, skipping insertion in model container [2019-09-16 16:13:27,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:13:27" (1/1) ... [2019-09-16 16:13:27,797 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:13:27,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:13:28,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:13:28,016 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:13:28,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:13:28,052 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:13:28,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28 WrapperNode [2019-09-16 16:13:28,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:13:28,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:13:28,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:13:28,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:13:28,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (1/1) ... [2019-09-16 16:13:28,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:13:28,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:13:28,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:13:28,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:13:28,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (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-16 16:13:28,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:13:28,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:13:28,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 16:13:28,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:13:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:13:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:13:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:13:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:13:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:13:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:13:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:13:28,440 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:13:28,440 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:13:28,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:13:28 BoogieIcfgContainer [2019-09-16 16:13:28,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:13:28,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:13:28,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:13:28,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:13:28,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:13:27" (1/3) ... [2019-09-16 16:13:28,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@806cfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:13:28, skipping insertion in model container [2019-09-16 16:13:28,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:13:28" (2/3) ... [2019-09-16 16:13:28,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@806cfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:13:28, skipping insertion in model container [2019-09-16 16:13:28,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:13:28" (3/3) ... [2019-09-16 16:13:28,465 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd.c [2019-09-16 16:13:28,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:13:28,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:13:28,514 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:13:28,563 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:13:28,564 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:13:28,564 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:13:28,564 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:13:28,565 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:13:28,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:13:28,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:13:28,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:13:28,565 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:13:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-09-16 16:13:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-16 16:13:28,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:28,595 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:28,599 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1589353370, now seen corresponding path program 1 times [2019-09-16 16:13:28,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:28,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:28,728 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-16 16:13:28,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:28,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:13:28,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:13:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:13:28,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:13:28,749 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-09-16 16:13:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:28,779 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2019-09-16 16:13:28,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:13:28,780 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-16 16:13:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:28,788 INFO L225 Difference]: With dead ends: 47 [2019-09-16 16:13:28,788 INFO L226 Difference]: Without dead ends: 21 [2019-09-16 16:13:28,799 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:13:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-16 16:13:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-16 16:13:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-16 16:13:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-09-16 16:13:28,839 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 10 [2019-09-16 16:13:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:28,840 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-09-16 16:13:28,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:13:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-09-16 16:13:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-16 16:13:28,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:28,842 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:28,842 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1587685074, now seen corresponding path program 1 times [2019-09-16 16:13:28,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:28,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:28,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:28,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:28,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:28,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:28,861 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:28,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-16 16:13:28,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:13:28,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:28,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:29,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:29,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:29,001 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 5 states. [2019-09-16 16:13:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:29,133 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-09-16 16:13:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:29,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-16 16:13:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:29,135 INFO L225 Difference]: With dead ends: 37 [2019-09-16 16:13:29,136 INFO L226 Difference]: Without dead ends: 35 [2019-09-16 16:13:29,137 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-16 16:13:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-16 16:13:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-16 16:13:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 16:13:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-09-16 16:13:29,153 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 10 [2019-09-16 16:13:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:29,154 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-09-16 16:13:29,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-09-16 16:13:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 16:13:29,155 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:29,155 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:29,155 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1592529048, now seen corresponding path program 1 times [2019-09-16 16:13:29,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,165 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:29,165 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:29,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:29,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:29,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-16 16:13:29,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:13:29,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:29,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:29,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:29,252 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 5 states. [2019-09-16 16:13:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:29,364 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-09-16 16:13:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:29,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-16 16:13:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:29,366 INFO L225 Difference]: With dead ends: 41 [2019-09-16 16:13:29,366 INFO L226 Difference]: Without dead ends: 39 [2019-09-16 16:13:29,367 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-16 16:13:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-16 16:13:29,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-09-16 16:13:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 16:13:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2019-09-16 16:13:29,379 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 15 [2019-09-16 16:13:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:29,379 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-09-16 16:13:29,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:29,379 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2019-09-16 16:13:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:13:29,380 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:29,380 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:29,380 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2040988462, now seen corresponding path program 1 times [2019-09-16 16:13:29,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:29,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,389 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:29,390 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:29,390 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:29,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-16 16:13:29,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:13:29,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:29,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:29,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:29,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:29,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:29,499 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand 5 states. [2019-09-16 16:13:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:29,585 INFO L93 Difference]: Finished difference Result 63 states and 91 transitions. [2019-09-16 16:13:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:29,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-16 16:13:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:29,590 INFO L225 Difference]: With dead ends: 63 [2019-09-16 16:13:29,590 INFO L226 Difference]: Without dead ends: 59 [2019-09-16 16:13:29,591 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-16 16:13:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-16 16:13:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-16 16:13:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-16 16:13:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2019-09-16 16:13:29,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2019-09-16 16:13:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:29,611 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2019-09-16 16:13:29,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2019-09-16 16:13:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:13:29,613 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:29,613 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:29,613 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 113727669, now seen corresponding path program 1 times [2019-09-16 16:13:29,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:29,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,623 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:29,623 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:29,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:29,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:13:29,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:13:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:29,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:29,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:29,722 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand 5 states. [2019-09-16 16:13:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:29,787 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2019-09-16 16:13:29,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:29,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-09-16 16:13:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:29,789 INFO L225 Difference]: With dead ends: 65 [2019-09-16 16:13:29,789 INFO L226 Difference]: Without dead ends: 63 [2019-09-16 16:13:29,790 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-16 16:13:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-16 16:13:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-16 16:13:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-16 16:13:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2019-09-16 16:13:29,805 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 26 [2019-09-16 16:13:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:29,805 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2019-09-16 16:13:29,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2019-09-16 16:13:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:13:29,807 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:29,807 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:29,807 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1597054094, now seen corresponding path program 1 times [2019-09-16 16:13:29,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,822 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:29,822 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:29,822 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:29,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:29,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-16 16:13:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-16 16:13:29,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:29,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:13:29,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:13:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:13:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:13:29,906 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 5 states. [2019-09-16 16:13:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:29,965 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-09-16 16:13:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:13:29,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-16 16:13:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:29,967 INFO L225 Difference]: With dead ends: 73 [2019-09-16 16:13:29,967 INFO L226 Difference]: Without dead ends: 70 [2019-09-16 16:13:29,968 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-16 16:13:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-16 16:13:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-16 16:13:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2019-09-16 16:13:29,982 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 28 [2019-09-16 16:13:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:29,982 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2019-09-16 16:13:29,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:13:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2019-09-16 16:13:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:13:29,984 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:29,984 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:29,984 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1857063759, now seen corresponding path program 1 times [2019-09-16 16:13:29,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:29,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:29,997 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:29,997 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:29,997 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:30,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:30,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-16 16:13:30,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 16:13:30,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:13:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:13:30,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:13:30,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:13:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:30,133 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand 6 states. [2019-09-16 16:13:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:30,260 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-09-16 16:13:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:13:30,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-16 16:13:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:30,262 INFO L225 Difference]: With dead ends: 81 [2019-09-16 16:13:30,262 INFO L226 Difference]: Without dead ends: 77 [2019-09-16 16:13:30,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-16 16:13:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-09-16 16:13:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-16 16:13:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-09-16 16:13:30,273 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2019-09-16 16:13:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:30,274 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-09-16 16:13:30,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:13:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-09-16 16:13:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:13:30,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:30,275 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:30,276 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash -493170476, now seen corresponding path program 2 times [2019-09-16 16:13:30,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:30,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,284 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:30,285 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:30,285 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:30,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:13:30,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:13:30,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:30,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-16 16:13:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 16:13:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:30,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-16 16:13:30,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:13:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:13:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:30,392 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 6 states. [2019-09-16 16:13:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:30,526 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-09-16 16:13:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:13:30,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-09-16 16:13:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:30,529 INFO L225 Difference]: With dead ends: 108 [2019-09-16 16:13:30,529 INFO L226 Difference]: Without dead ends: 106 [2019-09-16 16:13:30,530 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-16 16:13:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-09-16 16:13:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-16 16:13:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-09-16 16:13:30,570 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 33 [2019-09-16 16:13:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:30,571 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-09-16 16:13:30,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:13:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-09-16 16:13:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-16 16:13:30,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:30,576 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:30,576 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash -558447568, now seen corresponding path program 1 times [2019-09-16 16:13:30,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:30,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,592 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:30,593 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:30,593 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:30,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:30,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-16 16:13:30,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-16 16:13:30,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:30,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-16 16:13:30,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:13:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:13:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:13:30,713 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 6 states. [2019-09-16 16:13:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:30,861 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-09-16 16:13:30,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:13:30,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-09-16 16:13:30,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:30,863 INFO L225 Difference]: With dead ends: 125 [2019-09-16 16:13:30,863 INFO L226 Difference]: Without dead ends: 119 [2019-09-16 16:13:30,864 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-16 16:13:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-09-16 16:13:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-16 16:13:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2019-09-16 16:13:30,881 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 38 [2019-09-16 16:13:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:30,882 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2019-09-16 16:13:30,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:13:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2019-09-16 16:13:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 16:13:30,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:30,884 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:30,884 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1383929332, now seen corresponding path program 1 times [2019-09-16 16:13:30,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:30,891 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:30,891 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:30,892 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:30,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:30,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:30,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-16 16:13:31,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:31,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:31,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:31,008 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand 7 states. [2019-09-16 16:13:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:31,170 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2019-09-16 16:13:31,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:31,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-16 16:13:31,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:31,174 INFO L225 Difference]: With dead ends: 141 [2019-09-16 16:13:31,175 INFO L226 Difference]: Without dead ends: 139 [2019-09-16 16:13:31,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-16 16:13:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2019-09-16 16:13:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-16 16:13:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-16 16:13:31,207 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 46 [2019-09-16 16:13:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:31,207 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-16 16:13:31,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-16 16:13:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 16:13:31,213 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:31,213 INFO L407 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:31,217 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1192657524, now seen corresponding path program 2 times [2019-09-16 16:13:31,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:31,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,228 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:31,228 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:31,229 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:31,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:13:31,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:13:31,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:31,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:13:31,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-16 16:13:31,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:31,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:31,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:31,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:31,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:31,350 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 7 states. [2019-09-16 16:13:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:31,493 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2019-09-16 16:13:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:31,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-16 16:13:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:31,498 INFO L225 Difference]: With dead ends: 154 [2019-09-16 16:13:31,498 INFO L226 Difference]: Without dead ends: 151 [2019-09-16 16:13:31,503 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-16 16:13:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-09-16 16:13:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-16 16:13:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 189 transitions. [2019-09-16 16:13:31,526 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 189 transitions. Word has length 46 [2019-09-16 16:13:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:31,527 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 189 transitions. [2019-09-16 16:13:31,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2019-09-16 16:13:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 16:13:31,533 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:31,533 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:31,533 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1196309741, now seen corresponding path program 1 times [2019-09-16 16:13:31,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:31,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:31,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:31,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,553 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:31,553 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:31,553 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:31,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:13:31,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-16 16:13:31,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-16 16:13:31,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:31,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-16 16:13:31,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 16:13:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 16:13:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-16 16:13:31,720 INFO L87 Difference]: Start difference. First operand 148 states and 189 transitions. Second operand 9 states. [2019-09-16 16:13:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:31,875 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2019-09-16 16:13:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:13:31,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-09-16 16:13:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:31,877 INFO L225 Difference]: With dead ends: 161 [2019-09-16 16:13:31,878 INFO L226 Difference]: Without dead ends: 157 [2019-09-16 16:13:31,878 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-16 16:13:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-16 16:13:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-09-16 16:13:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-16 16:13:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 194 transitions. [2019-09-16 16:13:31,905 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 194 transitions. Word has length 49 [2019-09-16 16:13:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:31,905 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 194 transitions. [2019-09-16 16:13:31,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 16:13:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 194 transitions. [2019-09-16 16:13:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:13:31,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:31,907 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:31,907 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 336099856, now seen corresponding path program 3 times [2019-09-16 16:13:31,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:31,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:13:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:31,913 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:31,913 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:31,914 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:31,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:13:31,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:13:31,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:31,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-16 16:13:31,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 16:13:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:32,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:32,058 INFO L87 Difference]: Start difference. First operand 157 states and 194 transitions. Second operand 7 states. [2019-09-16 16:13:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:32,234 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-09-16 16:13:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:32,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-16 16:13:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:32,237 INFO L225 Difference]: With dead ends: 187 [2019-09-16 16:13:32,237 INFO L226 Difference]: Without dead ends: 185 [2019-09-16 16:13:32,238 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-16 16:13:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2019-09-16 16:13:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 16:13:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 224 transitions. [2019-09-16 16:13:32,262 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 224 transitions. Word has length 51 [2019-09-16 16:13:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:32,262 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 224 transitions. [2019-09-16 16:13:32,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 224 transitions. [2019-09-16 16:13:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 16:13:32,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:32,264 INFO L407 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:32,265 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1722303250, now seen corresponding path program 3 times [2019-09-16 16:13:32,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:32,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:32,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:32,278 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:32,278 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:32,278 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:32,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:13:32,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:13:32,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:32,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-16 16:13:32,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-16 16:13:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:32,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-16 16:13:32,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 16:13:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 16:13:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:13:32,421 INFO L87 Difference]: Start difference. First operand 181 states and 224 transitions. Second operand 7 states. [2019-09-16 16:13:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:32,576 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2019-09-16 16:13:32,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:32,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-16 16:13:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:32,579 INFO L225 Difference]: With dead ends: 210 [2019-09-16 16:13:32,579 INFO L226 Difference]: Without dead ends: 208 [2019-09-16 16:13:32,580 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-16 16:13:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-16 16:13:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2019-09-16 16:13:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-16 16:13:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2019-09-16 16:13:32,597 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 51 [2019-09-16 16:13:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:32,597 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2019-09-16 16:13:32,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 16:13:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2019-09-16 16:13:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 16:13:32,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:13:32,599 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:13:32,599 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:13:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:13:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1389199476, now seen corresponding path program 4 times [2019-09-16 16:13:32,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:13:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:13:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:32,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:13:32,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:13:32,605 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-16 16:13:32,605 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-16 16:13:32,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-16 16:13:32,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-16 16:13:32,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:13:32,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:13:32,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-16 16:13:32,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:13:34,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:13:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 48 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-16 16:13:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:13:34,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-16 16:13:34,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:13:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:13:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2019-09-16 16:13:34,973 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand 11 states. [2019-09-16 16:13:37,053 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-16 16:13:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:13:37,342 INFO L93 Difference]: Finished difference Result 198 states and 238 transitions. [2019-09-16 16:13:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 16:13:37,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-09-16 16:13:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:13:37,343 INFO L225 Difference]: With dead ends: 198 [2019-09-16 16:13:37,343 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:13:37,346 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2019-09-16 16:13:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:13:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:13:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:13:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:13:37,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-09-16 16:13:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:13:37,350 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:13:37,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:13:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:13:37,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:13:37,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:13:48,505 WARN L191 SmtUtils]: Spent 10.88 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-16 16:13:56,846 WARN L191 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-09-16 16:14:13,130 WARN L191 SmtUtils]: Spent 16.28 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-16 16:14:18,277 WARN L191 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-16 16:14:20,360 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-16 16:14:20,362 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:14:20,362 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:14:20,362 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:14:20,363 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:14:20,363 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:14:20,363 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:14:20,363 INFO L443 ceAbstractionStarter]: For program point L31(lines 28 45) no Hoare annotation was computed. [2019-09-16 16:14:20,363 INFO L439 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,363 INFO L439 ceAbstractionStarter]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,363 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 52) no Hoare annotation was computed. [2019-09-16 16:14:20,363 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-09-16 16:14:20,364 INFO L439 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (let ((.cse1 (= main_~p~0 1)) (.cse2 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse0 (= main_~s~0 1)) (.cse3 (= main_~b~0 main_~a~0)) (.cse4 (<= 1 main_~x~0)) (.cse6 (+ main_~p~0 main_~q~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= main_~r~0 0) .cse0 .cse1 .cse2 .cse4 .cse5 (= main_~a~0 main_~x~0)) (and .cse0 (= 1 .cse6) .cse3 (= (+ main_~q~0 1) 0) .cse4 (= main_~y~0 (+ main_~x~0 main_~b~0)) (= (+ main_~r~0 (* 2 main_~s~0)) 1)) (let ((.cse10 (+ main_~r~0 main_~s~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse9 (+ (* 2 main_~p~0) main_~q~0)) (.cse8 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse7 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse7 (- 1))) (+ (* main_~y~0 .cse8) (* main_~x~0 .cse9))) .cse7)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse9) (- (* .cse8 (+ main_~p~0 main_~q~0)))))))) .cse4 (= main_~a~0 (+ (+ (* main_~y~0 .cse10) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse10)) (* main_~s~0 .cse6))))))) [2019-09-16 16:14:20,364 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 52) no Hoare annotation was computed. [2019-09-16 16:14:20,364 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 44) no Hoare annotation was computed. [2019-09-16 16:14:20,364 INFO L439 ceAbstractionStarter]: At program point L36-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,364 INFO L439 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (<= 1 main_~x~0) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,364 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 52) the Hoare annotation is: true [2019-09-16 16:14:20,365 INFO L439 ceAbstractionStarter]: At program point L28-2(lines 28 45) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,365 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~s~0 1)) (.cse1 (<= 1 main_~x~0))) (or (and .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~q~0 0)) (and .cse0 (= main_~b~0 main_~a~0) (= (+ main_~q~0 1) 0) .cse1 (= main_~y~0 (+ main_~x~0 main_~b~0))) (let ((.cse5 (+ main_~r~0 main_~s~0)) (.cse6 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse4 (+ (* 2 main_~p~0) main_~q~0)) (.cse3 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse2 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse2 (- 1))) (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4))) .cse2)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse4) (- (* .cse3 (+ main_~p~0 main_~q~0)))))))) .cse1 (= main_~a~0 (+ (+ (* main_~y~0 .cse5) (* main_~x~0 .cse6)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse5)) (* main_~s~0 .cse6))))))) [2019-09-16 16:14:20,365 INFO L439 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (+ main_~r~0 main_~s~0)) (.cse4 (+ main_~p~0 main_~q~0))) (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (let ((.cse2 (+ (* 2 main_~p~0) main_~q~0)) (.cse1 (+ (* 2 main_~r~0) main_~s~0))) (and (let ((.cse0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (= (+ (+ (* (- 1) main_~b~0) (* .cse0 (- 1))) (+ (* main_~y~0 .cse1) (* main_~x~0 .cse2))) .cse0)) (= 1 (+ (* (+ main_~r~0 main_~s~0) .cse2) (- (* .cse1 (+ main_~p~0 main_~q~0)))))))) (<= 1 main_~x~0) (= main_~a~0 (+ (+ (* main_~y~0 .cse3) (* main_~x~0 .cse4)) (* (- 1) main_~b~0))) (= main_~b~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (= 1 (+ (- (* main_~q~0 .cse3)) (* main_~s~0 .cse4))))) [2019-09-16 16:14:20,366 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-16 16:14:20,366 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-16 16:14:20,366 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-16 16:14:20,366 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-16 16:14:20,366 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-16 16:14:20,366 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-16 16:14:20,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:14:20 BoogieIcfgContainer [2019-09-16 16:14:20,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:14:20,391 INFO L168 Benchmark]: Toolchain (without parser) took 52609.21 ms. Allocated memory was 133.7 MB in the beginning and 293.1 MB in the end (delta: 159.4 MB). Free memory was 88.1 MB in the beginning and 122.9 MB in the end (delta: -34.9 MB). Peak memory consumption was 124.5 MB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,392 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.37 ms. Allocated memory is still 133.7 MB. Free memory was 87.9 MB in the beginning and 78.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,393 INFO L168 Benchmark]: Boogie Preprocessor took 135.53 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 78.0 MB in the beginning and 177.9 MB in the end (delta: -99.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,394 INFO L168 Benchmark]: RCFGBuilder took 264.16 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 165.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,395 INFO L168 Benchmark]: TraceAbstraction took 51934.47 ms. Allocated memory was 201.3 MB in the beginning and 293.1 MB in the end (delta: 91.8 MB). Free memory was 165.0 MB in the beginning and 122.9 MB in the end (delta: 42.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:14:20,399 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.37 ms. Allocated memory is still 133.7 MB. Free memory was 87.9 MB in the beginning and 78.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.53 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 78.0 MB in the beginning and 177.9 MB in the end (delta: -99.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 264.16 ms. Allocated memory is still 201.3 MB. Free memory was 177.3 MB in the beginning and 165.0 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51934.47 ms. Allocated memory was 201.3 MB in the beginning and 293.1 MB in the end (delta: 91.8 MB). Free memory was 165.0 MB in the beginning and 122.9 MB in the end (delta: 42.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant [2019-09-16 16:14:20,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] [2019-09-16 16:14:20,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~r~0,QUANTIFIED] [2019-09-16 16:14:20,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~p~0,QUANTIFIED] Derived loop invariant: (((\exists main_~p~0 : int, main_~r~0 : int :: -1 * b + (main_~p~0 * x + y * main_~r~0) * -1 + (y * (2 * main_~r~0 + s) + x * (2 * main_~p~0 + q)) == main_~p~0 * x + y * main_~r~0 && 1 == (main_~r~0 + s) * (2 * main_~p~0 + q) + -((2 * main_~r~0 + s) * (main_~p~0 + q))) && a == y * (r + s) + x * (p + q) + -1 * b) && 1 <= x) && 1 == -(q * (r + s)) + s * (p + q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 51.8s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 43.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 119 SDslu, 1484 SDs, 0 SdLazy, 948 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 508 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 82 PreInvPairs, 158 NumberOfFragments, 917 HoareAnnotationTreeSize, 82 FomulaSimplifications, 9106 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 13 FomulaSimplificationsInter, 461 FormulaSimplificationTreeSizeReductionInter, 42.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 510 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 495 ConstructedInterpolants, 4 QuantifiedInterpolants, 126896 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 692/798 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...