java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:05:56,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:05:56,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:05:56,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:05:56,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:05:56,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:05:56,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:05:56,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:05:56,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:05:56,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:05:56,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:05:56,961 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:05:56,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:05:56,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:05:56,965 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:05:56,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:05:56,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:05:56,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:05:56,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:05:56,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:05:56,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:05:56,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:05:56,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:05:56,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:05:56,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:05:56,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:05:56,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:05:56,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:05:56,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:05:56,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:05:56,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:05:56,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:05:56,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:05:56,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:05:56,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:05:56,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:05:56,988 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:05:57,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:05:57,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:05:57,003 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:05:57,004 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:05:57,004 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:05:57,004 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:05:57,004 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:05:57,004 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:05:57,004 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:05:57,005 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:05:57,005 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:05:57,005 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:05:57,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:05:57,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:05:57,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:05:57,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:05:57,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:05:57,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:05:57,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:05:57,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:05:57,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:05:57,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:05:57,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:05:57,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:05:57,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:05:57,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:05:57,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:05:57,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:05:57,009 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:05:57,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:05:57,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:05:57,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:05:57,010 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:05:57,010 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:05:57,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:05:57,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:05:57,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:05:57,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:05:57,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:05:57,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 05:05:57,149 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1ec3b12/6259179dbafc4718bc8892f12449359a/FLAG0070b0bcf [2018-11-07 05:05:57,553 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:05:57,554 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 05:05:57,561 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1ec3b12/6259179dbafc4718bc8892f12449359a/FLAG0070b0bcf [2018-11-07 05:05:57,581 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1ec3b12/6259179dbafc4718bc8892f12449359a [2018-11-07 05:05:57,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:05:57,594 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:05:57,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:57,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:05:57,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:05:57,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9272d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57, skipping insertion in model container [2018-11-07 05:05:57,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:05:57,635 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:05:57,827 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:57,831 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:05:57,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:57,867 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:05:57,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57 WrapperNode [2018-11-07 05:05:57,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:57,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:57,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:05:57,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:05:57,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:57,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:05:57,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:05:57,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:05:57,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (1/1) ... [2018-11-07 05:05:57,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:05:57,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:05:57,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:05:57,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:05:57,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (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 [2018-11-07 05:05:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:05:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:05:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:05:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:05:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:05:58,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:05:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:05:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:05:58,288 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:05:58,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:58 BoogieIcfgContainer [2018-11-07 05:05:58,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:05:58,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:05:58,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:05:58,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:05:58,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:57" (1/3) ... [2018-11-07 05:05:58,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe274f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:58, skipping insertion in model container [2018-11-07 05:05:58,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:57" (2/3) ... [2018-11-07 05:05:58,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe274f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:58, skipping insertion in model container [2018-11-07 05:05:58,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:58" (3/3) ... [2018-11-07 05:05:58,296 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_true-termination.i [2018-11-07 05:05:58,306 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:05:58,313 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:05:58,329 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:05:58,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:05:58,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:05:58,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:05:58,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:05:58,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:05:58,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:05:58,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:05:58,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:05:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-07 05:05:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-07 05:05:58,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:58,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:58,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:58,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash -745796184, now seen corresponding path program 1 times [2018-11-07 05:05:58,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:58,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:05:58,501 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:58,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:05:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:05:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:05:58,519 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-07 05:05:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:58,541 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-07 05:05:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:05:58,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-07 05:05:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:58,552 INFO L225 Difference]: With dead ends: 45 [2018-11-07 05:05:58,553 INFO L226 Difference]: Without dead ends: 19 [2018-11-07 05:05:58,556 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:05:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-07 05:05:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-07 05:05:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-07 05:05:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-07 05:05:58,596 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-07 05:05:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:58,596 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-07 05:05:58,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:05:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-07 05:05:58,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:05:58,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:58,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:58,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:58,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:58,600 INFO L82 PathProgramCache]: Analyzing trace with hash 800081396, now seen corresponding path program 1 times [2018-11-07 05:05:58,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:58,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:58,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:58,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:58,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:05:58,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:58,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:05:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:05:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:05:58,958 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-07 05:05:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:59,143 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-07 05:05:59,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:05:59,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-07 05:05:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:59,145 INFO L225 Difference]: With dead ends: 32 [2018-11-07 05:05:59,145 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 05:05:59,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:05:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 05:05:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 05:05:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 05:05:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-07 05:05:59,153 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-07 05:05:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:59,153 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-07 05:05:59,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:05:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-07 05:05:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:05:59,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:59,155 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:59,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:59,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1097925811, now seen corresponding path program 1 times [2018-11-07 05:05:59,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:59,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:59,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 05:05:59,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:59,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:05:59,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:59,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:05:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:05:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:05:59,288 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-11-07 05:05:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:59,546 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-07 05:05:59,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:05:59,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-07 05:05:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:59,551 INFO L225 Difference]: With dead ends: 35 [2018-11-07 05:05:59,551 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 05:05:59,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:05:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 05:05:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-07 05:05:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 05:05:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-07 05:05:59,565 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-11-07 05:05:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:59,565 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-07 05:05:59,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:05:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-07 05:05:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:05:59,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:59,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:59,567 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:59,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:59,568 INFO L82 PathProgramCache]: Analyzing trace with hash -278190259, now seen corresponding path program 1 times [2018-11-07 05:05:59,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:59,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:59,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:59,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:59,708 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:59,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 05:05:59,711 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 05:05:59,766 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:59,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:06:00,098 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:06:00,099 INFO L272 AbstractInterpreter]: Visited 18 different actions 81 times. Merged at 5 different actions 42 times. Widened at 1 different actions 5 times. Found 4 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-07 05:06:00,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:00,135 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:06:00,239 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 50% of their original sizes. [2018-11-07 05:06:00,239 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:06:00,392 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-07 05:06:00,392 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:06:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:06:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-07 05:06:00,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:00,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:00,394 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 9 states. [2018-11-07 05:06:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:01,243 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-07 05:06:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:06:01,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-07 05:06:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:01,244 INFO L225 Difference]: With dead ends: 49 [2018-11-07 05:06:01,244 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 05:06:01,245 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:06:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 05:06:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2018-11-07 05:06:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-07 05:06:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-07 05:06:01,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-11-07 05:06:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:01,251 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-07 05:06:01,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-07 05:06:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:06:01,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:01,252 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:01,253 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:01,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -597656530, now seen corresponding path program 1 times [2018-11-07 05:06:01,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:01,256 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:06:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:01,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:01,367 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-07 05:06:01,367 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [10], [12], [15], [17], [26], [30], [32], [35], [37], [45], [49], [52], [54], [60], [61], [62], [64] [2018-11-07 05:06:01,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:06:01,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:06:01,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:06:01,548 INFO L272 AbstractInterpreter]: Visited 19 different actions 146 times. Merged at 10 different actions 89 times. Widened at 3 different actions 11 times. Found 13 fixpoints after 4 different actions. Largest state had 7 variables. [2018-11-07 05:06:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:01,585 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:06:01,630 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 50% of their original sizes. [2018-11-07 05:06:01,630 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:06:01,787 INFO L415 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2018-11-07 05:06:01,787 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:06:01,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:06:01,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-11-07 05:06:01,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:06:01,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:06:01,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:06:01,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:06:01,789 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-11-07 05:06:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:02,352 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-07 05:06:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:06:02,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-07 05:06:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:02,353 INFO L225 Difference]: With dead ends: 25 [2018-11-07 05:06:02,353 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:06:02,354 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-07 05:06:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:06:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:06:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:06:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:06:02,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-07 05:06:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:02,356 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:06:02,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:06:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:06:02,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:06:02,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:06:02,662 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 05:06:02,665 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 05:06:02,665 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:02,665 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:06:02,665 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:06:02,665 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L25(lines 10 28) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 28) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 24) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L21-3(lines 20 24) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L21-4(lines 10 28) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-11-07 05:06:02,666 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 17) no Hoare annotation was computed. [2018-11-07 05:06:02,667 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 28) no Hoare annotation was computed. [2018-11-07 05:06:02,667 INFO L425 ceAbstractionStarter]: For program point L15-3(lines 14 17) no Hoare annotation was computed. [2018-11-07 05:06:02,667 INFO L425 ceAbstractionStarter]: For program point L15-4(lines 10 28) no Hoare annotation was computed. [2018-11-07 05:06:02,667 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 28) the Hoare annotation is: true [2018-11-07 05:06:02,667 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (or (<= main_~i~0 99) (and (<= main_~i~0 (+ main_~j~0 100)) (<= main_~j~0 main_~i~0) (<= (* 2 main_~i~0) 398))) [2018-11-07 05:06:02,668 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-07 05:06:02,668 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-07 05:06:02,668 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 05:06:02,668 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 05:06:02,668 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:06:02,668 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 05:06:02,669 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 05:06:02,669 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:06:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:02 BoogieIcfgContainer [2018-11-07 05:06:02,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:06:02,673 INFO L168 Benchmark]: Toolchain (without parser) took 5079.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -596.8 MB). Peak memory consumption was 162.9 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:02,674 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:02,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:02,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:02,677 INFO L168 Benchmark]: Boogie Preprocessor took 24.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:06:02,677 INFO L168 Benchmark]: RCFGBuilder took 371.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:02,678 INFO L168 Benchmark]: TraceAbstraction took 4382.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 203.0 MB). Peak memory consumption was 203.0 MB. Max. memory is 7.1 GB. [2018-11-07 05:06:02,683 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 23.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 371.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -810.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4382.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 203.0 MB). Peak memory consumption was 203.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 36 SDslu, 193 SDs, 0 SdLazy, 83 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9374307862679956 AbsIntWeakeningRatio, 0.3953488372093023 AbsIntAvgWeakeningVarsNumRemoved, 0.5581395348837209 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 23 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 3783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3/12 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...