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/recursive-simple/id2_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:06:06,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:06:06,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:06:06,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:06:06,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:06:06,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:06:06,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:06:06,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:06:06,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:06:06,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:06:06,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:06:06,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:06:06,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:06:06,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:06:06,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:06:06,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:06:06,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:06:06,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:06:06,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:06:06,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:06:06,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:06:06,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:06:06,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:06:06,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:06:06,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:06:06,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:06:06,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:06:06,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:06:06,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:06:06,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:06:06,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:06:06,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:06:06,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:06:06,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:06:06,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:06:06,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:06:06,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:06:06,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:06:06,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:06:06,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:06:06,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:06:06,610 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 03:06:06,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:06:06,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:06:06,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:06:06,624 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:06:06,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:06:06,625 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:06:06,625 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:06:06,625 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:06:06,626 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:06:06,626 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:06:06,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:06:06,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:06:06,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:06:06,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:06:06,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:06:06,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:06:06,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:06:06,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:06:06,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:06:06,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:06:06,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:06:06,629 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:06:06,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:06:06,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:06:06,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:06:06,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:06:06,630 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:06:06,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:06:06,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:06:06,630 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:06:06,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:06:06,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:06:06,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:06:06,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:06:06,675 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:06:06,675 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2019-09-10 03:06:06,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cece224/a1464c25f50e4293a11e72c8983c2dbb/FLAGb7eaeb72d [2019-09-10 03:06:07,168 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:06:07,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2019-09-10 03:06:07,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cece224/a1464c25f50e4293a11e72c8983c2dbb/FLAGb7eaeb72d [2019-09-10 03:06:07,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24cece224/a1464c25f50e4293a11e72c8983c2dbb [2019-09-10 03:06:07,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:06:07,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:06:07,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:07,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:06:07,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:06:07,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d0a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07, skipping insertion in model container [2019-09-10 03:06:07,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:06:07,618 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:06:07,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:07,805 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:06:07,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:06:07,830 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:06:07,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07 WrapperNode [2019-09-10 03:06:07,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:06:07,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:06:07,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:06:07,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:06:07,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (1/1) ... [2019-09-10 03:06:07,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:06:07,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:06:07,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:06:07,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:06:07,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (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 03:06:08,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:06:08,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:06:08,012 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-09-10 03:06:08,012 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-09-10 03:06:08,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:06:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 03:06:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:06:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-09-10 03:06:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-09-10 03:06:08,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:06:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:06:08,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:06:08,191 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:06:08,192 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:06:08,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:08 BoogieIcfgContainer [2019-09-10 03:06:08,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:06:08,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:06:08,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:06:08,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:06:08,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:06:07" (1/3) ... [2019-09-10 03:06:08,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4feef0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:08, skipping insertion in model container [2019-09-10 03:06:08,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:06:07" (2/3) ... [2019-09-10 03:06:08,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4feef0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:06:08, skipping insertion in model container [2019-09-10 03:06:08,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:06:08" (3/3) ... [2019-09-10 03:06:08,203 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2019-09-10 03:06:08,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:06:08,231 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:06:08,283 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:06:08,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:06:08,330 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:06:08,331 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:06:08,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:06:08,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:06:08,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:06:08,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:06:08,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:06:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-10 03:06:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:06:08,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:08,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:08,354 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2019-09-10 03:06:08,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:08,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:08,595 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 03:06:08,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:08,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:08,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:08,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:08,616 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-09-10 03:06:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:08,664 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-09-10 03:06:08,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:08,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:06:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:08,676 INFO L225 Difference]: With dead ends: 34 [2019-09-10 03:06:08,677 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 03:06:08,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 03:06:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 03:06:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 03:06:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 03:06:08,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2019-09-10 03:06:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:08,729 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 03:06:08,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 03:06:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 03:06:08,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:08,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:08,733 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2019-09-10 03:06:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:08,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:08,890 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 03:06:08,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:08,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:08,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:08,900 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-09-10 03:06:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:08,930 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-09-10 03:06:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:08,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-10 03:06:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:08,933 INFO L225 Difference]: With dead ends: 30 [2019-09-10 03:06:08,934 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 03:06:08,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 03:06:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-09-10 03:06:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 03:06:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 03:06:08,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-09-10 03:06:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:08,948 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 03:06:08,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 03:06:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 03:06:08,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:08,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:08,950 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2019-09-10 03:06:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:08,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:08,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:09,121 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 03:06:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:06:09,122 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:09,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:06:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:06:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:06:09,123 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2019-09-10 03:06:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:09,181 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-09-10 03:06:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:06:09,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-10 03:06:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:09,183 INFO L225 Difference]: With dead ends: 34 [2019-09-10 03:06:09,184 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 03:06:09,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:06:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 03:06:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 03:06:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:06:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-10 03:06:09,190 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-09-10 03:06:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:09,191 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-10 03:06:09,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:06:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-10 03:06:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 03:06:09,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:09,193 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:09,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1451784300, now seen corresponding path program 1 times [2019-09-10 03:06:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:09,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:09,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:09,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:09,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:06:09,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:09,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:09,305 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-09-10 03:06:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:09,331 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-09-10 03:06:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:09,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-10 03:06:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:09,335 INFO L225 Difference]: With dead ends: 36 [2019-09-10 03:06:09,335 INFO L226 Difference]: Without dead ends: 36 [2019-09-10 03:06:09,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:06:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-10 03:06:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-09-10 03:06:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 03:06:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-10 03:06:09,349 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2019-09-10 03:06:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:09,350 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-10 03:06:09,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-10 03:06:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 03:06:09,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:09,353 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:09,353 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2019-09-10 03:06:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:09,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:09,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 03:06:09,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:09,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:09,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 03:06:09,581 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [7], [11], [12], [16], [18], [21], [23], [29], [32], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2019-09-10 03:06:09,615 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:09,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:09,673 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:06:09,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:06:09,733 INFO L272 AbstractInterpreter]: Visited 24 different actions 60 times. Merged at 10 different actions 16 times. Never widened. Performed 57 root evaluator evaluations with a maximum evaluation depth of 4. Performed 57 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 03:06:09,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:09,737 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:06:09,831 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:06:09,831 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:06:09,922 INFO L420 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2019-09-10 03:06:09,922 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:06:09,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:06:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2019-09-10 03:06:09,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:09,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:06:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:06:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:06:09,924 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2019-09-10 03:06:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:10,143 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-09-10 03:06:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:06:10,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-10 03:06:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:10,146 INFO L225 Difference]: With dead ends: 50 [2019-09-10 03:06:10,146 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:06:10,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:06:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-09-10 03:06:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 03:06:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-09-10 03:06:10,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 27 [2019-09-10 03:06:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:10,159 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-09-10 03:06:10,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:06:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-09-10 03:06:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-10 03:06:10,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:10,161 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:10,161 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2019-09-10 03:06:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:06:10,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:10,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:10,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2019-09-10 03:06:10,392 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [12], [16], [18], [21], [23], [29], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2019-09-10 03:06:10,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:06:10,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:06:10,397 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:06:10,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:06:10,411 INFO L272 AbstractInterpreter]: Visited 24 different actions 47 times. Merged at 8 different actions 8 times. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 4. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 03:06:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:10,412 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:06:10,449 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:06:10,450 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:06:10,542 INFO L420 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2019-09-10 03:06:10,542 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:06:10,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:06:10,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2019-09-10 03:06:10,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:10,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 03:06:10,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 03:06:10,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:06:10,544 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 14 states. [2019-09-10 03:06:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:10,725 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-09-10 03:06:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:06:10,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-10 03:06:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:10,729 INFO L225 Difference]: With dead ends: 54 [2019-09-10 03:06:10,729 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 03:06:10,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:06:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 03:06:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-10 03:06:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 03:06:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-09-10 03:06:10,743 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 34 [2019-09-10 03:06:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:10,744 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-09-10 03:06:10,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 03:06:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-09-10 03:06:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:06:10,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:10,749 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:10,749 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -292228316, now seen corresponding path program 1 times [2019-09-10 03:06:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 03:06:10,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:06:10,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:06:10,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:10,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:06:10,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:06:10,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:06:10,909 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2019-09-10 03:06:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:10,967 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-09-10 03:06:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:06:10,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-09-10 03:06:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:10,971 INFO L225 Difference]: With dead ends: 60 [2019-09-10 03:06:10,971 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 03:06:10,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:06:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 03:06:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-10 03:06:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 03:06:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-09-10 03:06:10,979 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 41 [2019-09-10 03:06:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:10,980 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-09-10 03:06:10,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:06:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-09-10 03:06:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-10 03:06:10,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:06:10,985 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:06:10,985 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:06:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:06:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2019-09-10 03:06:10,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:06:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:06:10,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:06:10,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:06:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:06:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:06:11,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:11,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:06:11,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:06:11,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:06:11,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:06:11,230 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:06:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:06:11,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:06:11,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-09-10 03:06:11,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:06:11,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:06:11,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:06:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 03:06:11,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:06:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 03:06:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:06:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 20 [2019-09-10 03:06:11,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:06:11,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:06:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:06:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:06:11,582 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 5 states. [2019-09-10 03:06:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:06:11,600 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-09-10 03:06:11,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:06:11,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-10 03:06:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:06:11,601 INFO L225 Difference]: With dead ends: 56 [2019-09-10 03:06:11,601 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:06:11,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:06:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:06:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:06:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:06:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:06:11,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2019-09-10 03:06:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:06:11,603 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:06:11,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:06:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:06:11,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:06:11,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:06:11 BoogieIcfgContainer [2019-09-10 03:06:11,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:06:11,617 INFO L168 Benchmark]: Toolchain (without parser) took 4027.67 ms. Allocated memory was 135.3 MB in the beginning and 254.3 MB in the end (delta: 119.0 MB). Free memory was 91.3 MB in the beginning and 136.0 MB in the end (delta: -44.8 MB). Peak memory consumption was 74.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,618 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,620 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.98 ms. Allocated memory is still 135.3 MB. Free memory was 90.8 MB in the beginning and 81.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,621 INFO L168 Benchmark]: Boogie Preprocessor took 119.73 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 81.6 MB in the beginning and 179.0 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,622 INFO L168 Benchmark]: RCFGBuilder took 242.65 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 167.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,627 INFO L168 Benchmark]: TraceAbstraction took 3417.64 ms. Allocated memory was 202.4 MB in the beginning and 254.3 MB in the end (delta: 51.9 MB). Free memory was 166.5 MB in the beginning and 136.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 82.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:06:11,632 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 243.98 ms. Allocated memory is still 135.3 MB. Free memory was 90.8 MB in the beginning and 81.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.73 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 81.6 MB in the beginning and 179.0 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 242.65 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 167.1 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3417.64 ms. Allocated memory was 202.4 MB in the beginning and 254.3 MB in the end (delta: 51.9 MB). Free memory was 166.5 MB in the beginning and 136.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 82.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 23 SDslu, 1103 SDs, 0 SdLazy, 102 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.7288135593220338 AbsIntWeakeningRatio, 0.6271186440677966 AbsIntAvgWeakeningVarsNumRemoved, 0.03389830508474576 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 278 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 27532 SizeOfPredicates, 3 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 133/149 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...