java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/Muller_Kahan.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:30:23,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:30:23,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:30:23,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:30:23,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:30:23,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:30:23,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:30:23,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:30:23,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:30:23,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:30:23,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:30:23,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:30:23,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:30:23,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:30:23,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:30:23,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:30:23,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:30:23,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:30:23,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:30:23,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:30:23,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:30:23,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:30:23,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:30:23,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:30:23,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:30:23,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:30:23,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:30:23,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:30:23,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:30:23,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:30:23,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:30:23,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:30:23,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:30:23,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:30:23,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:30:23,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:30:23,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:30:23,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:30:23,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:30:23,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:30:23,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:30:23,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:30:23,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:30:23,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:30:23,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:30:23,618 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:30:23,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:30:23,619 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:30:23,619 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:30:23,620 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:30:23,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:30:23,620 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:30:23,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:30:23,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:30:23,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:30:23,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:30:23,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:30:23,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:30:23,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:30:23,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:30:23,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:30:23,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:30:23,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:30:23,623 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:30:23,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:30:23,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:30:23,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:30:23,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:30:23,624 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:30:23,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:30:23,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:30:23,624 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:30:23,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:30:23,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:30:23,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:30:23,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:30:23,671 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:30:23,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2019-09-10 01:30:23,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a1a87c2/9e10fb480ba3410aa743dd1780811b8b/FLAG9d05aae93 [2019-09-10 01:30:24,187 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:30:24,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/Muller_Kahan.c.p+cfa-reducer.c [2019-09-10 01:30:24,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a1a87c2/9e10fb480ba3410aa743dd1780811b8b/FLAG9d05aae93 [2019-09-10 01:30:24,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a1a87c2/9e10fb480ba3410aa743dd1780811b8b [2019-09-10 01:30:24,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:30:24,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:30:24,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:24,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:30:24,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:30:24,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8c1c2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24, skipping insertion in model container [2019-09-10 01:30:24,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,621 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:30:24,643 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:30:24,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:24,809 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:30:24,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:30:24,835 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:30:24,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24 WrapperNode [2019-09-10 01:30:24,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:30:24,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:30:24,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:30:24,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:30:24,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... [2019-09-10 01:30:24,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:30:24,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:30:24,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:30:24,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:30:24,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:30:25,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:30:25,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:30:25,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:30:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:30:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:30:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:30:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:30:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:30:25,174 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:30:25,175 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:30:25,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:25 BoogieIcfgContainer [2019-09-10 01:30:25,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:30:25,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:30:25,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:30:25,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:30:25,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:30:24" (1/3) ... [2019-09-10 01:30:25,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f7f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:25, skipping insertion in model container [2019-09-10 01:30:25,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:30:24" (2/3) ... [2019-09-10 01:30:25,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f7f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:30:25, skipping insertion in model container [2019-09-10 01:30:25,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:30:25" (3/3) ... [2019-09-10 01:30:25,184 INFO L109 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c.p+cfa-reducer.c [2019-09-10 01:30:25,193 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:30:25,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:30:25,218 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:30:25,263 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:30:25,263 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:30:25,263 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:30:25,263 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:30:25,263 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:30:25,264 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:30:25,264 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:30:25,264 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:30:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-10 01:30:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 01:30:25,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:25,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:25,302 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:25,310 INFO L82 PathProgramCache]: Analyzing trace with hash -509317623, now seen corresponding path program 1 times [2019-09-10 01:30:25,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:25,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:30:25,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:30:25,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:30:25,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:30:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:30:25,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:25,487 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-09-10 01:30:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:25,514 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-09-10 01:30:25,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:30:25,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-10 01:30:25,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:25,526 INFO L225 Difference]: With dead ends: 19 [2019-09-10 01:30:25,526 INFO L226 Difference]: Without dead ends: 15 [2019-09-10 01:30:25,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:30:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-10 01:30:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-10 01:30:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:30:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-09-10 01:30:25,567 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-09-10 01:30:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:25,568 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-09-10 01:30:25,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:30:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-09-10 01:30:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:30:25,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:25,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:25,570 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash -472704980, now seen corresponding path program 1 times [2019-09-10 01:30:25,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:25,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:25,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:25,579 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:25,579 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:25,579 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:25,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:30:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:25,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 01:30:25,616 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [17], [19], [22], [23], [33], [34], [35] [2019-09-10 01:30:25,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:30:25,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:30:25,855 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:30:25,858 INFO L272 AbstractInterpreter]: Visited 12 different actions 26 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Performed 90 root evaluator evaluations with a maximum evaluation depth of 4. Performed 90 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2019-09-10 01:30:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:25,861 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:30:25,904 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 87.4% of their original sizes. [2019-09-10 01:30:25,904 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:30:25,928 INFO L420 sIntCurrentIteration]: We unified 12 AI predicates to 12 [2019-09-10 01:30:25,928 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:30:25,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:30:25,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:30:25,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:30:25,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:30:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:30:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:25,932 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-09-10 01:30:26,040 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:30:26,058 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPGT has no precise implementation. [2019-09-10 01:30:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:26,106 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-10 01:30:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:30:26,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-10 01:30:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:26,107 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:30:26,107 INFO L226 Difference]: Without dead ends: 20 [2019-09-10 01:30:26,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:30:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-10 01:30:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-09-10 01:30:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-10 01:30:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-09-10 01:30:26,112 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-09-10 01:30:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:26,113 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-09-10 01:30:26,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:30:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-09-10 01:30:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:30:26,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:26,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:26,115 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -457600943, now seen corresponding path program 1 times [2019-09-10 01:30:26,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:26,121 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:26,122 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:26,122 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:30:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:26,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:26,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-09-10 01:30:26,152 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [19], [22], [23], [28], [30], [33], [34], [35] [2019-09-10 01:30:26,157 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:30:26,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:30:26,180 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator COMPLT has no precise implementation. [2019-09-10 01:30:26,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 01:30:26,181 INFO L272 AbstractInterpreter]: Visited 13 different actions 27 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Performed 90 root evaluator evaluations with a maximum evaluation depth of 4. Performed 90 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 9 variables. [2019-09-10 01:30:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:26,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 01:30:26,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:26,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:26,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:26,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 01:30:26,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:26,257 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-10 01:30:26,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:26,293 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-10 01:30:26,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:30:26,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-10 01:30:26,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:26,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:30:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:30:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:30:26,300 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2019-09-10 01:30:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:26,312 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-09-10 01:30:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:30:26,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-09-10 01:30:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:26,313 INFO L225 Difference]: With dead ends: 17 [2019-09-10 01:30:26,313 INFO L226 Difference]: Without dead ends: 17 [2019-09-10 01:30:26,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-10 01:30:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-10 01:30:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-10 01:30:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-10 01:30:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-10 01:30:26,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-09-10 01:30:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:26,318 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-10 01:30:26,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:30:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-10 01:30:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 01:30:26,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:26,320 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:26,320 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1502402545, now seen corresponding path program 2 times [2019-09-10 01:30:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:26,326 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:26,327 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:26,327 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:26,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:26,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:30:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:26,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:26,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:26,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:26,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:26,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:26,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:26,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 01:30:26,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:26,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 01:30:26,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:26,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:30:26,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-10 01:30:26,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:26,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:30:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:30:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:30:26,535 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-09-10 01:30:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:26,549 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-09-10 01:30:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:30:26,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-09-10 01:30:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:26,552 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:30:26,552 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 01:30:26,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-10 01:30:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 01:30:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 01:30:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:30:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-10 01:30:26,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2019-09-10 01:30:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:26,557 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-10 01:30:26,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:30:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-10 01:30:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:30:26,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:26,558 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:26,559 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1420611791, now seen corresponding path program 3 times [2019-09-10 01:30:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:26,565 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:26,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:26,566 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:26,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:26,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:30:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:26,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:26,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:26,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:26,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:26,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:30:26,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:26,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:30:26,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:30:26,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:30:26,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:26,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:26,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:30:26,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-09-10 01:30:26,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:26,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 01:30:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 01:30:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:30:26,892 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2019-09-10 01:30:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:26,965 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 01:30:26,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 01:30:26,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-09-10 01:30:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:26,967 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:30:26,967 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 01:30:26,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:30:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 01:30:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 01:30:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:30:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-10 01:30:26,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 19 [2019-09-10 01:30:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:26,972 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-10 01:30:26,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 01:30:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-10 01:30:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 01:30:26,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:26,974 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:26,974 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash -164168271, now seen corresponding path program 4 times [2019-09-10 01:30:26,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:26,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:26,981 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:26,981 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:26,981 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:26,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:30:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:27,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:27,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:27,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:27,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:30:27,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:27,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:27,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:30:27,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:30:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:27,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:30:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:30:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:30:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-09-10 01:30:27,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:30:27,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 01:30:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 01:30:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:30:27,797 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 34 states. [2019-09-10 01:30:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:30:28,214 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-09-10 01:30:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 01:30:28,216 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 27 [2019-09-10 01:30:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:30:28,217 INFO L225 Difference]: With dead ends: 46 [2019-09-10 01:30:28,218 INFO L226 Difference]: Without dead ends: 46 [2019-09-10 01:30:28,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 01:30:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-10 01:30:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-09-10 01:30:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 01:30:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-09-10 01:30:28,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2019-09-10 01:30:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:30:28,228 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-09-10 01:30:28,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 01:30:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-09-10 01:30:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 01:30:28,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:30:28,231 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:30:28,231 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:30:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:30:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -315626450, now seen corresponding path program 5 times [2019-09-10 01:30:28,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:30:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:30:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:30:28,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:30:28,238 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:30:28,238 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:30:28,239 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:30:28,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:30:28,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:30:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:30:28,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:30:28,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:30:28,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:30:28,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:30:28,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 01:30:28,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 01:32:38,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-10 01:32:38,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:32:38,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 01:32:38,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:32:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:32:39,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:32:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:32:40,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:32:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2019-09-10 01:32:40,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:32:40,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 01:32:40,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 01:32:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 01:32:40,960 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 68 states. [2019-09-10 01:32:41,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:32:41,503 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2019-09-10 01:32:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 01:32:41,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 44 [2019-09-10 01:32:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:32:41,510 INFO L225 Difference]: With dead ends: 80 [2019-09-10 01:32:41,510 INFO L226 Difference]: Without dead ends: 80 [2019-09-10 01:32:41,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 01:32:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-10 01:32:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-10 01:32:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-10 01:32:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-09-10 01:32:41,527 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 44 [2019-09-10 01:32:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:32:41,528 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-09-10 01:32:41,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 01:32:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-09-10 01:32:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 01:32:41,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:32:41,533 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:32:41,535 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:32:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1405040270, now seen corresponding path program 6 times [2019-09-10 01:32:41,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:32:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:41,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:32:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:41,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:32:41,549 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:32:41,550 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:32:41,550 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:32:41,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:32:41,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:32:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:32:41,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 01:32:41,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:32:41,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:32:41,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:32:41,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 01:32:41,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 01:32:41,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 01:32:41,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 01:32:41,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-10 01:32:41,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:32:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:32:44,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:32:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:32:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-10 01:32:47,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 102 [2019-09-10 01:32:47,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 01:32:47,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-10 01:32:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-10 01:32:47,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 01:32:47,899 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 102 states. [2019-09-10 01:32:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:32:49,203 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2019-09-10 01:32:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-10 01:32:49,204 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 78 [2019-09-10 01:32:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:32:49,206 INFO L225 Difference]: With dead ends: 114 [2019-09-10 01:32:49,206 INFO L226 Difference]: Without dead ends: 114 [2019-09-10 01:32:49,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 21 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-09-10 01:32:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-10 01:32:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-09-10 01:32:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-10 01:32:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2019-09-10 01:32:49,218 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 78 [2019-09-10 01:32:49,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:32:49,219 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2019-09-10 01:32:49,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-10 01:32:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2019-09-10 01:32:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 01:32:49,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:32:49,236 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:32:49,237 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:32:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:32:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1891374866, now seen corresponding path program 7 times [2019-09-10 01:32:49,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:32:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:49,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 01:32:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:32:49,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:32:49,247 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:32:49,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:32:49,247 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:32:49,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:32:49,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:32:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-10 01:32:51,361 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-09-10 01:32:51,362 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 01:32:51,415 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-09-10 01:32:51,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:32:51 BoogieIcfgContainer [2019-09-10 01:32:51,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:32:51,418 INFO L168 Benchmark]: Toolchain (without parser) took 146813.18 ms. Allocated memory was 139.5 MB in the beginning and 414.2 MB in the end (delta: 274.7 MB). Free memory was 87.2 MB in the beginning and 360.9 MB in the end (delta: -273.7 MB). Peak memory consumption was 995.2 kB. Max. memory is 7.1 GB. [2019-09-10 01:32:51,419 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:32:51,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.50 ms. Allocated memory is still 139.5 MB. Free memory was 87.2 MB in the beginning and 77.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:32:51,420 INFO L168 Benchmark]: Boogie Preprocessor took 114.83 ms. Allocated memory was 139.5 MB in the beginning and 198.2 MB in the end (delta: 58.7 MB). Free memory was 77.8 MB in the beginning and 175.6 MB in the end (delta: -97.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:32:51,421 INFO L168 Benchmark]: RCFGBuilder took 225.16 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 164.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:32:51,422 INFO L168 Benchmark]: TraceAbstraction took 146238.28 ms. Allocated memory was 198.2 MB in the beginning and 414.2 MB in the end (delta: 216.0 MB). Free memory was 164.6 MB in the beginning and 360.9 MB in the end (delta: -196.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-09-10 01:32:51,426 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.22 ms. Allocated memory is still 139.5 MB. Free memory is still 105.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.50 ms. Allocated memory is still 139.5 MB. Free memory was 87.2 MB in the beginning and 77.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.83 ms. Allocated memory was 139.5 MB in the beginning and 198.2 MB in the end (delta: 58.7 MB). Free memory was 77.8 MB in the beginning and 175.6 MB in the end (delta: -97.8 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 225.16 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 164.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 146238.28 ms. Allocated memory was 198.2 MB in the beginning and 414.2 MB in the end (delta: 216.0 MB). Free memory was 164.6 MB in the beginning and 360.9 MB in the end (delta: -196.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 39]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1] int __return_main; [L7] double main__x0; [L8] double main__x1; [L9] double main__x2; [L10] int main__i; [L11] main__x0 = 5.5 [L12] main__x1 = 5.545454545454546 [L13] main__i = 0 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND TRUE main__i < 100 [L17] main__x2 = 111.0 - ((1130.0 - (3000.0 / main__x0)) / main__x1) [L18] main__x0 = main__x1 [L19] main__x1 = main__x2 [L20] main__i = main__i + 1 [L15] COND FALSE !(main__i < 100) [L25] int main____CPAchecker_TMP_0; [L26] COND FALSE !(main__x0 >= 99.0) [L51] main____CPAchecker_TMP_0 = 0 [L33] int __tmp_1; [L34] __tmp_1 = main____CPAchecker_TMP_0 [L35] int __VERIFIER_assert__cond; [L36] __VERIFIER_assert__cond = __tmp_1 [L37] COND TRUE __VERIFIER_assert__cond == 0 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. UNKNOWN Result, 146.1s OverallTime, 9 OverallIterations, 100 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 18 SDslu, 247 SDs, 0 SdLazy, 146 SolverSat, 57 SolverUnsat, 118 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 136 SyntacticMatches, 34 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.7236111111111111 AbsIntWeakeningRatio, 0.8333333333333334 AbsIntAvgWeakeningVarsNumRemoved, 2.1666666666666665 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 132.8s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 47251 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1302 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/5788 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...