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/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:50:46,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:50:46,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:50:46,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:50:46,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:50:46,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:50:46,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:50:46,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:50:46,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:50:46,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:50:46,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:50:46,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:50:46,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:50:46,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:50:46,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:50:46,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:50:46,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:50:46,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:50:46,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:50:46,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:50:46,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:50:46,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:50:46,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:50:46,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:50:46,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:50:46,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:50:46,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:50:46,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:50:46,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:50:46,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:50:46,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:50:46,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:50:46,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:50:46,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:50:46,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:50:46,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:50:46,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:50:46,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:50:46,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:50:46,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:50:46,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:50:46,773 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-05 11:50:46,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:50:46,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:50:46,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:50:46,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:50:46,790 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:50:46,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:50:46,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:50:46,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:50:46,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:50:46,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:50:46,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:50:46,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:50:46,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:50:46,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:50:46,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:50:46,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:50:46,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:50:46,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:50:46,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:50:46,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:50:46,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:50:46,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:50:46,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:50:46,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:50:46,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:50:46,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:50:46,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:50:46,845 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:50:46,846 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:50:46,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-09-05 11:50:46,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c389602f5/5faf99fdc7644c21bd1f928e75092d83/FLAG33badf489 [2019-09-05 11:50:47,315 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:50:47,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-09-05 11:50:47,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c389602f5/5faf99fdc7644c21bd1f928e75092d83/FLAG33badf489 [2019-09-05 11:50:47,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c389602f5/5faf99fdc7644c21bd1f928e75092d83 [2019-09-05 11:50:47,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:50:47,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:50:47,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:50:47,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:50:47,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:50:47,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:47,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47, skipping insertion in model container [2019-09-05 11:50:47,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:47,746 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:50:47,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:50:47,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:50:47,933 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:50:47,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:50:47,960 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:50:47,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47 WrapperNode [2019-09-05 11:50:47,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:50:47,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:50:47,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:50:47,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:50:48,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (1/1) ... [2019-09-05 11:50:48,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:50:48,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:50:48,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:50:48,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:50:48,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (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-05 11:50:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:50:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:50:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:50:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:50:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:50:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:50:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:50:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:50:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:50:48,294 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:50:48,295 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:50:48,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:50:48 BoogieIcfgContainer [2019-09-05 11:50:48,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:50:48,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:50:48,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:50:48,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:50:48,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:50:47" (1/3) ... [2019-09-05 11:50:48,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a02f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:50:48, skipping insertion in model container [2019-09-05 11:50:48,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:50:47" (2/3) ... [2019-09-05 11:50:48,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a02f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:50:48, skipping insertion in model container [2019-09-05 11:50:48,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:50:48" (3/3) ... [2019-09-05 11:50:48,310 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2019-09-05 11:50:48,319 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:50:48,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:50:48,340 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:50:48,369 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:50:48,370 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:50:48,370 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:50:48,370 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:50:48,371 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:50:48,371 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:50:48,371 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:50:48,371 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:50:48,371 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:50:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-05 11:50:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:50:48,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:48,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:48,393 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-05 11:50:48,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:48,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:48,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:48,615 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-05 11:50:48,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:50:48,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:50:48,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:50:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:50:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:50:48,676 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-05 11:50:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:48,728 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-05 11:50:48,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:50:48,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:50:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:48,739 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:50:48,740 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:50:48,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:50:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:50:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:50:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:50:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-05 11:50:48,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-05 11:50:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:48,784 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-05 11:50:48,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:50:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-05 11:50:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 11:50:48,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:48,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:48,786 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-05 11:50:48,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:48,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:48,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:48,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:48,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:48,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:50:48,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:48,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:48,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:50:48,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:50:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:50:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:50:48,958 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-05 11:50:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:48,977 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-05 11:50:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:50:48,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-05 11:50:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:48,979 INFO L225 Difference]: With dead ends: 18 [2019-09-05 11:50:48,979 INFO L226 Difference]: Without dead ends: 13 [2019-09-05 11:50:48,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:50:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-05 11:50:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-05 11:50:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-05 11:50:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-05 11:50:48,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-05 11:50:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:48,988 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-05 11:50:48,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:50:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-05 11:50:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:50:48,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:48,989 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:48,989 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-05 11:50:48,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:50:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:49,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:49,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:50:49,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:49,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:50:49,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:49,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:50:49,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:50:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:50:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:50:49,187 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-05 11:50:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:49,220 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 11:50:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:50:49,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-05 11:50:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:49,221 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:50:49,221 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:50:49,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:50:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:50:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:50:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:50:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-05 11:50:49,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-05 11:50:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:49,227 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-05 11:50:49,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:50:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-05 11:50:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:50:49,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:49,228 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:49,228 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-05 11:50:49,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:49,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:49,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:49,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:49,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:49,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 11:50:49,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:49,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-05 11:50:49,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:49,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:50:49,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:50:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:50:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:50:49,380 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-05 11:50:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:49,418 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-05 11:50:49,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:50:49,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-05 11:50:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:49,420 INFO L225 Difference]: With dead ends: 20 [2019-09-05 11:50:49,420 INFO L226 Difference]: Without dead ends: 15 [2019-09-05 11:50:49,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:50:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-05 11:50:49,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-05 11:50:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-05 11:50:49,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-05 11:50:49,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-05 11:50:49,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:49,426 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-05 11:50:49,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:50:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-05 11:50:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:50:49,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:49,427 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:49,427 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:49,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-05 11:50:49,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:49,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:49,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:49,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:49,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:49,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:50:49,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:49,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 11:50:49,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:49,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:50:49,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:50:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:50:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:50:49,618 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-05 11:50:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:49,657 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-05 11:50:49,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:50:49,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-05 11:50:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:49,659 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:50:49,659 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:50:49,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:50:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:50:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:50:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:50:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-05 11:50:49,663 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-05 11:50:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:49,664 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-05 11:50:49,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:50:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-05 11:50:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:50:49,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:49,665 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:49,665 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-05 11:50:49,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:49,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:49,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:50:49,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:50:49,857 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-05 11:50:49,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:49,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-05 11:50:49,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:50:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:50:49,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:50:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:50:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:50:49,897 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-05 11:50:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:49,954 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-05 11:50:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:50:49,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-05 11:50:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:49,956 INFO L225 Difference]: With dead ends: 22 [2019-09-05 11:50:49,956 INFO L226 Difference]: Without dead ends: 17 [2019-09-05 11:50:49,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:50:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-05 11:50:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-05 11:50:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-05 11:50:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-05 11:50:49,963 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-05 11:50:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:49,964 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-05 11:50:49,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:50:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-05 11:50:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:50:49,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:49,965 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:49,966 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-05 11:50:49,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:49,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:49,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:51:00,710 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 18 [2019-09-05 11:51:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:51:00,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:51:00,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:51:00,771 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:51:00,799 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-05 11:51:00,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:51:00,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-05 11:51:00,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:51:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:51:45,444 WARN L188 SmtUtils]: Spent 8.82 s on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-05 11:52:12,415 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 74 [2019-09-05 11:52:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:52:12,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:52:12,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-05 11:52:12,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:52:12,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:52:12,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=268, Unknown=24, NotChecked=0, Total=342 [2019-09-05 11:52:12,464 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2019-09-05 11:53:10,250 WARN L188 SmtUtils]: Spent 21.74 s on a formula simplification that was a NOOP. DAG size: 85 [2019-09-05 11:53:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:12,687 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-05 11:53:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:53:12,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-09-05 11:53:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:12,688 INFO L225 Difference]: With dead ends: 27 [2019-09-05 11:53:12,688 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 11:53:12,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 104.2s TimeCoverageRelationStatistics Valid=61, Invalid=335, Unknown=24, NotChecked=0, Total=420 [2019-09-05 11:53:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 11:53:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 11:53:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 11:53:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-05 11:53:12,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-05 11:53:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:12,694 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-05 11:53:12,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:53:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-05 11:53:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:53:12,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:53:12,695 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:53:12,695 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:53:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:53:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2019-09-05 11:53:12,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:53:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:53:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:12,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:53:12,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:53:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:53:12,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:53:12,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:53:12,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:53:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:53:12,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:53:12,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:53:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:53:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:53:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-05 11:53:12,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:53:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:53:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:53:12,859 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-09-05 11:53:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:53:12,912 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-05 11:53:12,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:53:12,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-05 11:53:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:53:12,914 INFO L225 Difference]: With dead ends: 19 [2019-09-05 11:53:12,914 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:53:12,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:53:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:53:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:53:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:53:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:53:12,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-09-05 11:53:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:53:12,916 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:53:12,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:53:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:53:12,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:53:12,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:53:13,256 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-05 11:53:13,270 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 11:53:13,270 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:53:13,270 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:53:13,270 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:53:13,270 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:53:13,271 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:53:13,271 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2019-09-05 11:53:13,271 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2019-09-05 11:53:13,271 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2019-09-05 11:53:13,271 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 17) the Hoare annotation is: (let ((.cse16 (div (- main_~y~0) (- 2)))) (let ((.cse7 (div main_~y~0 2)) (.cse4 (div .cse16 2))) (let ((.cse15 (div (- .cse4) (- 2))) (.cse17 (div (- .cse7) (- 2)))) (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse2 (= (mod .cse7 (- 2)) 0)) (.cse3 (= 0 (mod .cse17 2))) (.cse1 (div .cse17 2)) (.cse5 (= (mod main_~y~0 (- 2)) 0)) (.cse8 (= 0 (mod .cse15 2))) (.cse9 (= (mod .cse4 (- 2)) 0)) (.cse6 (= (mod .cse16 2) 0)) (.cse10 (div .cse15 2))) (or (and .cse0 (<= main_~x~0 3) (<= .cse1 1) .cse2 (<= 3 main_~x~0) (<= 1 .cse1) .cse3) (and (<= 1 .cse4) .cse5 (<= 2 main_~x~0) .cse6 (<= main_~x~0 2) (<= .cse4 1)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= .cse7 1) .cse0 (<= main_~x~0 1) (<= 1 main_~x~0) (<= 1 .cse7)) (let ((.cse11 (div (- .cse10) (- 2)))) (let ((.cse12 (div .cse11 2))) (and .cse5 .cse8 .cse9 (= (mod .cse10 (- 2)) 0) (<= main_~x~0 6) (= (mod .cse11 2) 0) .cse6 (<= 6 main_~x~0) (<= .cse12 1) (<= 1 .cse12)))) (let ((.cse13 (div (- .cse1) (- 2)))) (let ((.cse14 (div .cse13 2))) (and (= (mod .cse13 2) 0) .cse0 (= (mod .cse1 (- 2)) 0) (<= 1 .cse14) (<= 5 main_~x~0) .cse2 .cse3 (<= .cse14 1) (<= main_~x~0 5)))) (and (<= .cse10 1) .cse5 .cse8 (<= 4 main_~x~0) .cse9 .cse6 (<= main_~x~0 4) (<= 1 .cse10))))))) [2019-09-05 11:53:13,272 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (not (= main_~y~0 (let ((.cse0 (div main_~y~0 4294967296))) (let ((.cse1 (* (- 4294967296) .cse0))) (let ((.cse2 (div (+ .cse1 main_~y~0) 3))) (+ (* 4294967296 .cse0) (* 4294967296 (div (+ .cse1 main_~y~0 (* (- 3) .cse2)) 4294967296)) (* 3 .cse2))))))) [2019-09-05 11:53:13,272 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-05 11:53:13,272 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-05 11:53:13,272 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:53:13,272 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-05 11:53:13,273 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-05 11:53:13,273 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-05 11:53:13,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:53:13 BoogieIcfgContainer [2019-09-05 11:53:13,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:53:13,296 INFO L168 Benchmark]: Toolchain (without parser) took 145566.82 ms. Allocated memory was 139.5 MB in the beginning and 261.6 MB in the end (delta: 122.2 MB). Free memory was 86.8 MB in the beginning and 144.0 MB in the end (delta: -57.3 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,297 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.54 ms. Allocated memory is still 139.5 MB. Free memory was 86.6 MB in the beginning and 77.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,298 INFO L168 Benchmark]: Boogie Preprocessor took 117.45 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 77.4 MB in the beginning and 176.8 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,299 INFO L168 Benchmark]: RCFGBuilder took 216.80 ms. Allocated memory is still 199.2 MB. Free memory was 176.8 MB in the beginning and 166.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,300 INFO L168 Benchmark]: TraceAbstraction took 144997.18 ms. Allocated memory was 199.2 MB in the beginning and 261.6 MB in the end (delta: 62.4 MB). Free memory was 165.5 MB in the beginning and 144.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:53:13,304 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.54 ms. Allocated memory is still 139.5 MB. Free memory was 86.6 MB in the beginning and 77.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.45 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 77.4 MB in the beginning and 176.8 MB in the end (delta: -99.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 216.80 ms. Allocated memory is still 199.2 MB. Free memory was 176.8 MB in the beginning and 166.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144997.18 ms. Allocated memory was 199.2 MB in the beginning and 261.6 MB in the end (delta: 62.4 MB). Free memory was 165.5 MB in the beginning and 144.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 14]: Loop Invariant Derived loop invariant: (((((((((((y % 2 == 0 && x <= 3) && -(y / 2) / -2 / 2 <= 1) && y / 2 % -2 == 0) && 3 <= x) && 1 <= -(y / 2) / -2 / 2) && 0 == -(y / 2) / -2 % 2) || (((((1 <= -y / -2 / 2 && y % -2 == 0) && 2 <= x) && -y / -2 % 2 == 0) && x <= 2) && -y / -2 / 2 <= 1)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((((y / 2 <= 1 && y % 2 == 0) && x <= 1) && 1 <= x) && 1 <= y / 2)) || (((((((((y % -2 == 0 && 0 == -(-y / -2 / 2) / -2 % 2) && -y / -2 / 2 % -2 == 0) && -(-y / -2 / 2) / -2 / 2 % -2 == 0) && x <= 6) && -(-(-y / -2 / 2) / -2 / 2) / -2 % 2 == 0) && -y / -2 % 2 == 0) && 6 <= x) && -(-(-y / -2 / 2) / -2 / 2) / -2 / 2 <= 1) && 1 <= -(-(-y / -2 / 2) / -2 / 2) / -2 / 2)) || ((((((((-(-(y / 2) / -2 / 2) / -2 % 2 == 0 && y % 2 == 0) && -(y / 2) / -2 / 2 % -2 == 0) && 1 <= -(-(y / 2) / -2 / 2) / -2 / 2) && 5 <= x) && y / 2 % -2 == 0) && 0 == -(y / 2) / -2 % 2) && -(-(y / 2) / -2 / 2) / -2 / 2 <= 1) && x <= 5)) || (((((((-(-y / -2 / 2) / -2 / 2 <= 1 && y % -2 == 0) && 0 == -(-y / -2 / 2) / -2 % 2) && 4 <= x) && -y / -2 / 2 % -2 == 0) && -y / -2 % 2 == 0) && x <= 4) && 1 <= -(-y / -2 / 2) / -2 / 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 144.9s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 60.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 2 SDslu, 290 SDs, 0 SdLazy, 263 SolverSat, 22 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 37.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 104.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 435 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 654 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 83.2s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 193 ConstructedInterpolants, 2 QuantifiedInterpolants, 24290 SizeOfPredicates, 7 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 30/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...