java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/sqrt1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 12:31:49,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 12:31:49,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 12:31:49,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 12:31:49,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 12:31:49,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 12:31:49,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 12:31:49,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 12:31:49,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 12:31:49,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 12:31:49,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 12:31:49,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 12:31:49,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 12:31:49,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 12:31:49,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 12:31:49,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 12:31:49,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 12:31:49,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 12:31:49,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 12:31:49,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 12:31:49,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 12:31:49,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 12:31:49,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 12:31:49,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 12:31:49,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 12:31:49,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 12:31:49,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 12:31:49,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 12:31:49,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 12:31:49,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 12:31:49,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 12:31:49,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 12:31:49,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 12:31:49,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 12:31:49,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 12:31:49,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 12:31:49,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 12:31:49,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 12:31:49,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 12:31:49,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 12:31:49,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 12:31:49,494 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 12:31:49,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 12:31:49,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 12:31:49,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 12:31:49,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 12:31:49,517 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 12:31:49,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 12:31:49,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 12:31:49,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 12:31:49,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 12:31:49,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 12:31:49,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 12:31:49,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 12:31:49,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 12:31:49,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 12:31:49,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 12:31:49,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 12:31:49,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 12:31:49,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 12:31:49,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 12:31:49,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 12:31:49,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 12:31:49,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 12:31:49,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 12:31:49,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 12:31:49,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 12:31:49,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 12:31:49,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 12:31:49,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 12:31:49,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 12:31:49,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 12:31:49,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 12:31:49,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 12:31:49,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 12:31:49,595 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 12:31:49,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/sqrt1.c [2019-09-05 12:31:49,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4d3e06b/f89be73c907e42abb119c25095ed8816/FLAGfe2134a53 [2019-09-05 12:31:50,047 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 12:31:50,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/sqrt1.c [2019-09-05 12:31:50,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4d3e06b/f89be73c907e42abb119c25095ed8816/FLAGfe2134a53 [2019-09-05 12:31:50,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab4d3e06b/f89be73c907e42abb119c25095ed8816 [2019-09-05 12:31:50,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 12:31:50,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 12:31:50,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 12:31:50,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 12:31:50,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 12:31:50,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b03c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50, skipping insertion in model container [2019-09-05 12:31:50,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,455 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 12:31:50,475 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 12:31:50,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:31:50,624 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 12:31:50,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 12:31:50,654 INFO L192 MainTranslator]: Completed translation [2019-09-05 12:31:50,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50 WrapperNode [2019-09-05 12:31:50,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 12:31:50,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 12:31:50,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 12:31:50,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 12:31:50,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (1/1) ... [2019-09-05 12:31:50,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 12:31:50,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 12:31:50,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 12:31:50,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 12:31:50,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (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 12:31:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 12:31:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 12:31:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 12:31:50,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 12:31:50,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 12:31:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 12:31:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 12:31:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 12:31:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 12:31:50,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 12:31:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 12:31:50,990 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 12:31:50,991 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 12:31:50,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:31:50 BoogieIcfgContainer [2019-09-05 12:31:50,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 12:31:51,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 12:31:51,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 12:31:51,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 12:31:51,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:31:50" (1/3) ... [2019-09-05 12:31:51,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb15890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:31:51, skipping insertion in model container [2019-09-05 12:31:51,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:31:50" (2/3) ... [2019-09-05 12:31:51,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb15890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:31:51, skipping insertion in model container [2019-09-05 12:31:51,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:31:50" (3/3) ... [2019-09-05 12:31:51,014 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt1.c [2019-09-05 12:31:51,046 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 12:31:51,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 12:31:51,095 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 12:31:51,127 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 12:31:51,127 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 12:31:51,128 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 12:31:51,128 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 12:31:51,128 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 12:31:51,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 12:31:51,128 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 12:31:51,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 12:31:51,129 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 12:31:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-05 12:31:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:31:51,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:51,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:51,153 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1435220999, now seen corresponding path program 1 times [2019-09-05 12:31:51,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:51,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:31:51,295 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 12:31:51,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:31:51,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 12:31:51,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 12:31:51,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 12:31:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 12:31:51,320 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-05 12:31:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:51,353 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2019-09-05 12:31:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 12:31:51,354 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 12:31:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:51,366 INFO L225 Difference]: With dead ends: 43 [2019-09-05 12:31:51,366 INFO L226 Difference]: Without dead ends: 19 [2019-09-05 12:31:51,373 INFO L628 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-05 12:31:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-05 12:31:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-05 12:31:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-05 12:31:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-09-05 12:31:51,407 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2019-09-05 12:31:51,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:51,408 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-09-05 12:31:51,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 12:31:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-09-05 12:31:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 12:31:51,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:51,409 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:51,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1444634955, now seen corresponding path program 1 times [2019-09-05 12:31:51,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:31:51,530 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 12:31:51,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 12:31:51,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 12:31:51,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 12:31:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 12:31:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 12:31:51,533 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2019-09-05 12:31:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:51,608 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-05 12:31:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 12:31:51,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-05 12:31:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:51,610 INFO L225 Difference]: With dead ends: 25 [2019-09-05 12:31:51,610 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 12:31:51,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 12:31:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 12:31:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 12:31:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 12:31:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-05 12:31:51,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 10 [2019-09-05 12:31:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:51,621 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-05 12:31:51,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 12:31:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-05 12:31:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 12:31:51,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:51,623 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:51,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:51,624 INFO L82 PathProgramCache]: Analyzing trace with hash -892290774, now seen corresponding path program 1 times [2019-09-05 12:31:51,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:51,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:51,636 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:31:51,636 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:31:51,636 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 (exit command is (exit), workingDir is null) [2019-09-05 12:31:51,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:31:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:31:51,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 12:31:51,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:31:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 12:31:51,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:31:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-05 12:31:51,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:31:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:31:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:31:51,788 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2019-09-05 12:31:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:52,014 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-09-05 12:31:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 12:31:52,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-09-05 12:31:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:52,016 INFO L225 Difference]: With dead ends: 41 [2019-09-05 12:31:52,016 INFO L226 Difference]: Without dead ends: 36 [2019-09-05 12:31:52,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:31:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-05 12:31:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-09-05 12:31:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 12:31:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-09-05 12:31:52,029 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 15 [2019-09-05 12:31:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:52,029 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-09-05 12:31:52,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:31:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-09-05 12:31:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 12:31:52,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:52,031 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:52,031 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash -751011113, now seen corresponding path program 1 times [2019-09-05 12:31:52,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,040 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:31:52,040 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:31:52,040 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:31:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 12:31:52,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:31:52,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:31:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-05 12:31:52,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:31:52,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-05 12:31:52,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 12:31:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 12:31:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-05 12:31:52,168 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 8 states. [2019-09-05 12:31:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:52,380 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2019-09-05 12:31:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:31:52,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-05 12:31:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:52,382 INFO L225 Difference]: With dead ends: 50 [2019-09-05 12:31:52,383 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 12:31:52,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:31:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 12:31:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-05 12:31:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 12:31:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2019-09-05 12:31:52,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 32 [2019-09-05 12:31:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:52,400 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-09-05 12:31:52,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 12:31:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2019-09-05 12:31:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 12:31:52,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:52,404 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:52,404 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2078000632, now seen corresponding path program 2 times [2019-09-05 12:31:52,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:52,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 12:31:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,423 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:31:52,423 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:31:52,423 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 (exit command is (exit), workingDir is null) [2019-09-05 12:31:52,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 12:31:52,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 12:31:52,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:31:52,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 12:31:52,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:31:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 12:31:52,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:31:52,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-05 12:31:52,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:31:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:31:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:31:52,552 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 9 states. [2019-09-05 12:31:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:52,754 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-09-05 12:31:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 12:31:52,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-09-05 12:31:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:52,758 INFO L225 Difference]: With dead ends: 58 [2019-09-05 12:31:52,758 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 12:31:52,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-05 12:31:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 12:31:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-09-05 12:31:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 12:31:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-09-05 12:31:52,780 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 37 [2019-09-05 12:31:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:52,783 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-09-05 12:31:52,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:31:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-09-05 12:31:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 12:31:52,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:52,785 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:52,785 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 541108426, now seen corresponding path program 3 times [2019-09-05 12:31:52,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:31:52,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:52,801 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:31:52,801 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:31:52,801 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 (exit command is (exit), workingDir is null) [2019-09-05 12:31:52,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:31:52,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 12:31:52,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:31:52,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-05 12:31:52,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:31:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-05 12:31:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:31:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-05 12:31:52,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 12:31:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 12:31:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:31:52,964 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 10 states. [2019-09-05 12:31:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:53,218 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-09-05 12:31:53,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 12:31:53,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-09-05 12:31:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:53,221 INFO L225 Difference]: With dead ends: 71 [2019-09-05 12:31:53,221 INFO L226 Difference]: Without dead ends: 66 [2019-09-05 12:31:53,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-05 12:31:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-05 12:31:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-05 12:31:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 12:31:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-09-05 12:31:53,249 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 49 [2019-09-05 12:31:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:53,249 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-09-05 12:31:53,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 12:31:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-09-05 12:31:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 12:31:53,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 12:31:53,255 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 12:31:53,255 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 12:31:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 12:31:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 922074935, now seen corresponding path program 4 times [2019-09-05 12:31:53,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 12:31:53,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 12:31:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:53,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 12:31:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 12:31:53,263 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 12:31:53,263 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 12:31:53,263 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 12:31:53,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 12:31:53,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 12:31:53,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 12:31:53,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 12:31:53,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 12:31:53,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 12:31:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 12:31:53,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-05 12:31:53,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-05 12:31:53,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 12:31:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 12:31:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-05 12:31:53,457 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 9 states. [2019-09-05 12:31:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 12:31:53,541 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-09-05 12:31:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 12:31:53,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-05 12:31:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 12:31:53,543 INFO L225 Difference]: With dead ends: 66 [2019-09-05 12:31:53,543 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 12:31:53,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-05 12:31:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 12:31:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 12:31:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 12:31:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 12:31:53,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-09-05 12:31:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 12:31:53,547 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 12:31:53,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 12:31:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 12:31:53,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 12:31:53,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 12:31:53,839 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-05 12:31:53,839 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:31:53,839 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 12:31:53,839 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 12:31:53,839 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 12:31:53,839 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 12:31:53,839 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 15 42) the Hoare annotation is: true [2019-09-05 12:31:53,840 INFO L443 ceAbstractionStarter]: For program point L26(lines 23 35) no Hoare annotation was computed. [2019-09-05 12:31:53,840 INFO L439 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,840 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 15 42) no Hoare annotation was computed. [2019-09-05 12:31:53,840 INFO L439 ceAbstractionStarter]: At program point L24(line 24) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,840 INFO L439 ceAbstractionStarter]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,841 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 35) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,841 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 35) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,841 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 15 42) no Hoare annotation was computed. [2019-09-05 12:31:53,843 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-05 12:31:53,844 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,844 INFO L439 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (let ((.cse1 (+ (* 2 main_~a~0) 1))) (and (= (let ((.cse0 (+ main_~a~0 1))) (* .cse0 .cse0)) main_~s~0) (<= .cse1 main_~t~0) (<= main_~t~0 .cse1))) [2019-09-05 12:31:53,844 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-09-05 12:31:53,844 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 12) the Hoare annotation is: true [2019-09-05 12:31:53,844 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 12) no Hoare annotation was computed. [2019-09-05 12:31:53,845 INFO L443 ceAbstractionStarter]: For program point L8(lines 8 9) no Hoare annotation was computed. [2019-09-05 12:31:53,845 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 10) no Hoare annotation was computed. [2019-09-05 12:31:53,845 INFO L443 ceAbstractionStarter]: For program point L7-2(lines 6 12) no Hoare annotation was computed. [2019-09-05 12:31:53,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:31:53 BoogieIcfgContainer [2019-09-05 12:31:53,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 12:31:53,866 INFO L168 Benchmark]: Toolchain (without parser) took 3425.72 ms. Allocated memory was 140.5 MB in the beginning and 258.5 MB in the end (delta: 118.0 MB). Free memory was 88.3 MB in the beginning and 174.1 MB in the end (delta: -85.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,868 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.56 ms. Allocated memory is still 140.5 MB. Free memory was 88.1 MB in the beginning and 78.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,870 INFO L168 Benchmark]: Boogie Preprocessor took 117.23 ms. Allocated memory was 140.5 MB in the beginning and 200.3 MB in the end (delta: 59.8 MB). Free memory was 78.7 MB in the beginning and 177.9 MB in the end (delta: -99.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,872 INFO L168 Benchmark]: RCFGBuilder took 219.75 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,878 INFO L168 Benchmark]: TraceAbstraction took 2860.67 ms. Allocated memory was 200.3 MB in the beginning and 258.5 MB in the end (delta: 58.2 MB). Free memory was 166.4 MB in the beginning and 174.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-09-05 12:31:53,886 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.40 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 214.56 ms. Allocated memory is still 140.5 MB. Free memory was 88.1 MB in the beginning and 78.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.23 ms. Allocated memory was 140.5 MB in the beginning and 200.3 MB in the end (delta: 59.8 MB). Free memory was 78.7 MB in the beginning and 177.9 MB in the end (delta: -99.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 219.75 ms. Allocated memory is still 200.3 MB. Free memory was 177.9 MB in the beginning and 166.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2860.67 ms. Allocated memory was 200.3 MB in the beginning and 258.5 MB in the end (delta: 58.2 MB). Free memory was 166.4 MB in the beginning and 174.1 MB in the end (delta: -7.7 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 23]: Loop Invariant Derived loop invariant: ((a + 1) * (a + 1) == s && 2 * a + 1 <= t) && t <= 2 * a + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 2.7s OverallTime, 7 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 71 SDslu, 401 SDs, 0 SdLazy, 643 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 41 PreInvPairs, 69 NumberOfFragments, 173 HoareAnnotationTreeSize, 41 FomulaSimplifications, 598 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 286 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 38960 SizeOfPredicates, 22 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 332/424 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...