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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:57:36,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:57:36,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:57:36,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:57:36,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:57:36,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:57:36,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:57:36,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:57:36,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:57:36,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:57:36,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:57:36,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:57:36,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:57:36,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:57:36,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:57:36,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:57:36,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:57:36,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:57:36,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:57:36,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:57:36,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:57:36,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:57:36,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:57:36,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:57:36,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:57:36,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:57:36,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:57:36,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:57:36,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:57:36,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:57:36,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:57:36,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:57:36,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:57:36,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:57:36,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:57:36,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:57:36,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:57:36,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:57:36,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:57:36,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:57:36,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:57:36,320 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-20 12:57:36,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:57:36,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:57:36,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:57:36,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:57:36,336 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:57:36,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:57:36,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:57:36,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:57:36,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:57:36,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:57:36,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:57:36,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:57:36,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:57:36,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:57:36,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:57:36,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:57:36,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:57:36,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:57:36,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:57:36,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:57:36,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:57:36,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:57:36,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:57:36,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:57:36,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:57:36,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:57:36,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:57:36,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:57:36,403 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:57:36,404 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2019-09-20 12:57:36,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220c169dd/b07764bf944540ea9154d97e70fb87d6/FLAG79cabebb1 [2019-09-20 12:57:36,974 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:57:36,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2019-09-20 12:57:36,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220c169dd/b07764bf944540ea9154d97e70fb87d6/FLAG79cabebb1 [2019-09-20 12:57:37,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220c169dd/b07764bf944540ea9154d97e70fb87d6 [2019-09-20 12:57:37,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:57:37,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:57:37,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:37,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:57:37,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:57:37,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc1dbaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37, skipping insertion in model container [2019-09-20 12:57:37,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,344 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:57:37,363 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:57:37,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:37,536 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:57:37,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:37,569 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:57:37,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37 WrapperNode [2019-09-20 12:57:37,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:37,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:57:37,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:57:37,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:57:37,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (1/1) ... [2019-09-20 12:57:37,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:57:37,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:57:37,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:57:37,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:57:37,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (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-20 12:57:37,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:57:37,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:57:37,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:57:37,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:57:37,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:57:37,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:57:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:57:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:57:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:57:37,924 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:57:37,925 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:57:37,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:37 BoogieIcfgContainer [2019-09-20 12:57:37,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:57:37,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:57:37,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:57:37,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:57:37,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:57:37" (1/3) ... [2019-09-20 12:57:37,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a412109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:37, skipping insertion in model container [2019-09-20 12:57:37,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:37" (2/3) ... [2019-09-20 12:57:37,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a412109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:37, skipping insertion in model container [2019-09-20 12:57:37,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:37" (3/3) ... [2019-09-20 12:57:37,934 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2019-09-20 12:57:37,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:57:37,951 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:57:37,967 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:57:37,996 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:57:37,996 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:57:37,997 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:57:37,997 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:57:37,997 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:57:37,997 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:57:37,997 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:57:37,997 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:57:37,997 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:57:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-20 12:57:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:57:38,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,019 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,021 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2019-09-20 12:57:38,028 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:38,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,123 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-20 12:57:38,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:38,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:57:38,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:57:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:57:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:38,149 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-20 12:57:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,173 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-09-20 12:57:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:57:38,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 12:57:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,183 INFO L225 Difference]: With dead ends: 29 [2019-09-20 12:57:38,184 INFO L226 Difference]: Without dead ends: 12 [2019-09-20 12:57:38,188 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-20 12:57:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-20 12:57:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-20 12:57:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-20 12:57:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-20 12:57:38,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-20 12:57:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,230 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-20 12:57:38,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:57:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-20 12:57:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:57:38,231 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,231 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,232 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2019-09-20 12:57:38,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,311 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-20 12:57:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:38,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:57:38,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:57:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:57:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:57:38,316 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2019-09-20 12:57:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,376 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-20 12:57:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:57:38,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-20 12:57:38,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,378 INFO L225 Difference]: With dead ends: 19 [2019-09-20 12:57:38,378 INFO L226 Difference]: Without dead ends: 14 [2019-09-20 12:57:38,379 INFO L636 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-20 12:57:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-20 12:57:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-09-20 12:57:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-20 12:57:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-20 12:57:38,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-09-20 12:57:38,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,386 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-20 12:57:38,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:57:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-20 12:57:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 12:57:38,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,391 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2019-09-20 12:57:38,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,545 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-20 12:57:38,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:38,546 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:38,585 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-20 12:57:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:57:38,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:38,641 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-20 12:57:38,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:38,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-20 12:57:38,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:57:38,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:57:38,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:38,647 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-09-20 12:57:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,675 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-20 12:57:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:57:38,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 12:57:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,677 INFO L225 Difference]: With dead ends: 21 [2019-09-20 12:57:38,677 INFO L226 Difference]: Without dead ends: 16 [2019-09-20 12:57:38,678 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-20 12:57:38,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-09-20 12:57:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-20 12:57:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-20 12:57:38,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-09-20 12:57:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,683 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-20 12:57:38,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:57:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-20 12:57:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 12:57:38,684 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,684 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,685 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2019-09-20 12:57:38,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:38,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:38,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:38,760 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:57:38,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:38,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:57:38,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:38,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:38,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-20 12:57:38,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:57:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:57:38,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:57:38,816 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-09-20 12:57:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:38,863 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-20 12:57:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:57:38,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 12:57:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:38,865 INFO L225 Difference]: With dead ends: 23 [2019-09-20 12:57:38,865 INFO L226 Difference]: Without dead ends: 18 [2019-09-20 12:57:38,866 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:57:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-20 12:57:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-20 12:57:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-20 12:57:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-20 12:57:38,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-09-20 12:57:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:38,875 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-20 12:57:38,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:57:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-20 12:57:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:57:38,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:38,878 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:38,879 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2019-09-20 12:57:38,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:38,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:38,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:38,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:38,952 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:57:38,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 12:57:38,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:38,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:57:38,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:39,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-20 12:57:39,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:57:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:57:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:57:39,017 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-09-20 12:57:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:39,063 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-09-20 12:57:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:57:39,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-20 12:57:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:39,065 INFO L225 Difference]: With dead ends: 25 [2019-09-20 12:57:39,065 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 12:57:39,066 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:57:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 12:57:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-09-20 12:57:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-20 12:57:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-20 12:57:39,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-20 12:57:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:39,072 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-20 12:57:39,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:57:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-20 12:57:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 12:57:39,073 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:39,073 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:39,074 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2019-09-20 12:57:39,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:39,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:57:39,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:57:39,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:39,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 12:57:39,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:39,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-20 12:57:39,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:57:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:57:39,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:57:39,251 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2019-09-20 12:57:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:39,306 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-09-20 12:57:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:57:39,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-20 12:57:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:39,309 INFO L225 Difference]: With dead ends: 27 [2019-09-20 12:57:39,309 INFO L226 Difference]: Without dead ends: 22 [2019-09-20 12:57:39,310 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:57:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-20 12:57:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-20 12:57:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 12:57:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-09-20 12:57:39,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-09-20 12:57:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:39,326 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-09-20 12:57:39,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:57:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-09-20 12:57:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:57:39,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:39,329 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:39,330 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2019-09-20 12:57:39,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:39,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:39,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:57:39,483 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-20 12:57:39,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:39,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:57:39,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:39,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-20 12:57:39,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:57:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:57:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:57:39,519 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2019-09-20 12:57:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:39,575 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-20 12:57:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:57:39,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-20 12:57:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:39,577 INFO L225 Difference]: With dead ends: 29 [2019-09-20 12:57:39,577 INFO L226 Difference]: Without dead ends: 24 [2019-09-20 12:57:39,578 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:57:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-20 12:57:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-20 12:57:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-20 12:57:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-09-20 12:57:39,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-09-20 12:57:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:39,588 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-09-20 12:57:39,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:57:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-09-20 12:57:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 12:57:39,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:39,590 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:39,591 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2019-09-20 12:57:39,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:39,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:39,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:39,695 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:39,715 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-20 12:57:39,729 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-20 12:57:39,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:39,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:57:39,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-20 12:57:39,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:57:39,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:57:39,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:39,752 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2019-09-20 12:57:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:39,792 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-09-20 12:57:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:57:39,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-20 12:57:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:39,794 INFO L225 Difference]: With dead ends: 31 [2019-09-20 12:57:39,794 INFO L226 Difference]: Without dead ends: 26 [2019-09-20 12:57:39,795 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-20 12:57:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-20 12:57:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 12:57:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-09-20 12:57:39,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-09-20 12:57:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:39,800 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-09-20 12:57:39,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:57:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-09-20 12:57:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:57:39,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:39,801 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:39,802 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:39,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2019-09-20 12:57:39,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:39,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:39,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:39,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:39,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 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-20 12:57:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:39,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:57:39,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:39,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-20 12:57:39,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:57:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:57:39,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:57:39,952 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2019-09-20 12:57:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:40,001 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-09-20 12:57:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:57:40,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-20 12:57:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:40,002 INFO L225 Difference]: With dead ends: 32 [2019-09-20 12:57:40,003 INFO L226 Difference]: Without dead ends: 27 [2019-09-20 12:57:40,003 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:57:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-20 12:57:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-20 12:57:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 12:57:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-09-20 12:57:40,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-09-20 12:57:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:40,008 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-09-20 12:57:40,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:57:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-09-20 12:57:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:57:40,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:40,009 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:40,010 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2019-09-20 12:57:40,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:40,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:40,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:40,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:40,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:40,239 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:40,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:40,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:40,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:40,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-20 12:57:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:40,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:57:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:40,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:40,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-09-20 12:57:40,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:57:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:57:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:57:40,378 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2019-09-20 12:57:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:40,510 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-09-20 12:57:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:57:40,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-09-20 12:57:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:40,512 INFO L225 Difference]: With dead ends: 34 [2019-09-20 12:57:40,512 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 12:57:40,513 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:57:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 12:57:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-20 12:57:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:57:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-09-20 12:57:40,518 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-09-20 12:57:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:40,519 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-09-20 12:57:40,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 12:57:40,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-09-20 12:57:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:57:40,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:40,520 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:40,520 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:40,521 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2019-09-20 12:57:40,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:40,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:40,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:40,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:40,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 12:57:40,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:57:40,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:57:40,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:57:40,658 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2019-09-20 12:57:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:40,750 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-09-20 12:57:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:57:40,750 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-20 12:57:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:40,751 INFO L225 Difference]: With dead ends: 29 [2019-09-20 12:57:40,751 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:57:40,751 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:57:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:57:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:57:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:57:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:57:40,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-09-20 12:57:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:40,752 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:57:40,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:57:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:57:40,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:57:40,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:57:40,858 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 12:57:40,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:57:40,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:57:40,858 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:57:40,858 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:57:40,858 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:57:40,858 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2019-09-20 12:57:40,859 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2019-09-20 12:57:40,859 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2019-09-20 12:57:40,859 INFO L443 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2019-09-20 12:57:40,859 INFO L439 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6) (<= main_~sn~0 10)) (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 7 main_~i~0) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= main_~i~0 7)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0))) [2019-09-20 12:57:40,860 INFO L439 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2019-09-20 12:57:40,860 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-20 12:57:40,860 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-20 12:57:40,860 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:57:40,860 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-20 12:57:40,860 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-20 12:57:40,860 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:57:40,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:57:40 BoogieIcfgContainer [2019-09-20 12:57:40,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:57:40,881 INFO L168 Benchmark]: Toolchain (without parser) took 3554.25 ms. Allocated memory was 138.4 MB in the beginning and 266.9 MB in the end (delta: 128.5 MB). Free memory was 86.6 MB in the beginning and 221.9 MB in the end (delta: -135.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 12:57:40,882 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:57:40,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.29 ms. Allocated memory is still 138.4 MB. Free memory was 86.4 MB in the beginning and 77.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:40,884 INFO L168 Benchmark]: Boogie Preprocessor took 116.84 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 77.1 MB in the beginning and 175.6 MB in the end (delta: -98.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:40,884 INFO L168 Benchmark]: RCFGBuilder took 238.07 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 164.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:40,885 INFO L168 Benchmark]: TraceAbstraction took 2951.34 ms. Allocated memory was 198.2 MB in the beginning and 266.9 MB in the end (delta: 68.7 MB). Free memory was 164.9 MB in the beginning and 221.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:40,889 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.47 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.29 ms. Allocated memory is still 138.4 MB. Free memory was 86.4 MB in the beginning and 77.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.84 ms. Allocated memory was 138.4 MB in the beginning and 198.2 MB in the end (delta: 59.8 MB). Free memory was 77.1 MB in the beginning and 175.6 MB in the end (delta: -98.5 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 238.07 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 164.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2951.34 ms. Allocated memory was 198.2 MB in the beginning and 266.9 MB in the end (delta: 68.7 MB). Free memory was 164.9 MB in the beginning and 221.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 11.7 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: 13]: Loop Invariant Derived loop invariant: ((((((((((10 <= sn && 6 <= i) && i <= 6) && sn <= 10) || (((1 <= i && i <= 1) && sn <= 0) && 0 <= sn)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((7 <= i && 12 <= sn) && sn <= 12) && i <= 7)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 38 SDslu, 400 SDs, 0 SdLazy, 269 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, 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, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17729 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...