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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:41,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:41,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:41,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:41,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:41,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:41,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:41,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:41,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:41,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:41,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:41,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:41,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:41,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:41,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:41,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:41,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:41,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:41,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:41,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:41,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:41,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:41,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:41,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:41,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:41,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:41,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:41,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:41,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:41,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:41,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:41,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:41,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:41,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:41,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:41,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:41,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:41,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:41,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:41,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:41,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:41,696 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-03 20:51:41,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:41,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:41,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:41,728 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:41,728 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:41,729 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:41,729 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:41,729 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:41,729 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:41,729 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:41,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:41,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:41,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:41,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:41,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:41,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:41,732 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:41,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:41,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:41,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:41,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:41,733 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:41,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:41,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:41,733 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:41,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:41,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:41,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:41,777 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:41,778 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:41,778 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-03 20:51:41,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0791dee/c36774b0244d4d1bb724457cc76beff9/FLAG618827fb5 [2019-09-03 20:51:42,297 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:42,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-03 20:51:42,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0791dee/c36774b0244d4d1bb724457cc76beff9/FLAG618827fb5 [2019-09-03 20:51:42,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0791dee/c36774b0244d4d1bb724457cc76beff9 [2019-09-03 20:51:42,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:42,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:42,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:42,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:42,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:42,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:42" (1/1) ... [2019-09-03 20:51:42,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d76297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:42, skipping insertion in model container [2019-09-03 20:51:42,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:42" (1/1) ... [2019-09-03 20:51:42,701 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:42,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:42,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:42,923 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:43,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:43,070 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:43,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43 WrapperNode [2019-09-03 20:51:43,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:43,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:43,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:43,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:43,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (1/1) ... [2019-09-03 20:51:43,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:43,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:43,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:43,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:43,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (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-03 20:51:43,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:43,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 20:51:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 20:51:43,507 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:43,507 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:43,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:43 BoogieIcfgContainer [2019-09-03 20:51:43,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:43,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:43,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:43,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:43,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:42" (1/3) ... [2019-09-03 20:51:43,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1429e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:43, skipping insertion in model container [2019-09-03 20:51:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:43" (2/3) ... [2019-09-03 20:51:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1429e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:43, skipping insertion in model container [2019-09-03 20:51:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:43" (3/3) ... [2019-09-03 20:51:43,516 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-03 20:51:43,524 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:43,532 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-03 20:51:43,547 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-03 20:51:43,573 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:43,573 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:43,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:43,574 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:43,574 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:43,574 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:43,574 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:43,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-03 20:51:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:51:43,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:43,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:43,603 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-09-03 20:51:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:43,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:43,781 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-03 20:51:43,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:43,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:43,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:43,800 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-09-03 20:51:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:43,834 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-03 20:51:43,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:43,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 20:51:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:43,846 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:51:43,847 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 20:51:43,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 20:51:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-03 20:51:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 20:51:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-03 20:51:43,880 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-09-03 20:51:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:43,880 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-03 20:51:43,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-03 20:51:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:43,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:43,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:43,883 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-09-03 20:51:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:43,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:43,972 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-03 20:51:43,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:43,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:43,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:43,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:43,978 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-09-03 20:51:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:44,032 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-09-03 20:51:44,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:44,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 20:51:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:44,034 INFO L225 Difference]: With dead ends: 49 [2019-09-03 20:51:44,035 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 20:51:44,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:51:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 20:51:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-09-03 20:51:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:51:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-03 20:51:44,045 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-09-03 20:51:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:44,045 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-03 20:51:44,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-03 20:51:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:44,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:44,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:44,047 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:44,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-09-03 20:51:44,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:44,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:44,111 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-03 20:51:44,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:44,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:44,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:44,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:44,113 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-09-03 20:51:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:44,154 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-03 20:51:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:44,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:51:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:44,157 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:51:44,157 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:51:44,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:51:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-03 20:51:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 20:51:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 20:51:44,163 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-09-03 20:51:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:44,163 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 20:51:44,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:44,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 20:51:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:51:44,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:44,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:44,165 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-09-03 20:51:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:44,198 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-03 20:51:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:44,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:44,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:44,199 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-09-03 20:51:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:44,234 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 20:51:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:44,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-03 20:51:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:44,235 INFO L225 Difference]: With dead ends: 34 [2019-09-03 20:51:44,235 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:51:44,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:51:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-03 20:51:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:51:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-03 20:51:44,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-09-03 20:51:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:44,240 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-03 20:51:44,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-03 20:51:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:51:44,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:44,242 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-03 20:51:44,242 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-09-03 20:51:44,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:44,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:44,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:44,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:44,686 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-03 20:51:45,375 WARN L188 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 92 [2019-09-03 20:51:45,743 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2019-09-03 20:51:45,764 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-03 20:51:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:45,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 20:51:45,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:45,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:51:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:51:45,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:51:45,767 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-03 20:51:45,962 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2019-09-03 20:51:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:46,181 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-03 20:51:46,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:51:46,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 20:51:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:46,182 INFO L225 Difference]: With dead ends: 29 [2019-09-03 20:51:46,182 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 20:51:46,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:51:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 20:51:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 20:51:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:51:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-03 20:51:46,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-09-03 20:51:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:46,187 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-03 20:51:46,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:51:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-03 20:51:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:51:46,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:46,188 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, 1] [2019-09-03 20:51:46,188 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-09-03 20:51:46,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:46,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:46,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:46,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:46,237 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-03 20:51:46,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:46,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:46,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:46,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:46,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:46,240 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-09-03 20:51:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:46,300 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-03 20:51:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:46,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-03 20:51:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:46,303 INFO L225 Difference]: With dead ends: 40 [2019-09-03 20:51:46,303 INFO L226 Difference]: Without dead ends: 40 [2019-09-03 20:51:46,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:51:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-03 20:51:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-09-03 20:51:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 20:51:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-03 20:51:46,312 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-03 20:51:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:46,312 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-03 20:51:46,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-03 20:51:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 20:51:46,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:46,313 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:46,314 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-09-03 20:51:46,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:46,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:46,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:46,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:46,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:46,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:46,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-03 20:51:46,507 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [62], [66], [69], [70], [72], [91], [92], [93] [2019-09-03 20:51:46,545 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:46,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:46,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:51:46,650 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-09-03 20:51:46,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:46,654 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:51:46,699 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-03 20:51:46,700 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:51:46,703 INFO L420 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-09-03 20:51:46,703 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:51:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:51:46,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-03 20:51:46,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:46,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:51:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:51:46,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:51:46,705 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 2 states. [2019-09-03 20:51:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:46,707 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-03 20:51:46,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:51:46,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-09-03 20:51:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:46,708 INFO L225 Difference]: With dead ends: 6 [2019-09-03 20:51:46,708 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:46,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:51:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:46,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-09-03 20:51:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:46,710 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:46,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:51:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:46,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:46,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:46 BoogieIcfgContainer [2019-09-03 20:51:46,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:46,718 INFO L168 Benchmark]: Toolchain (without parser) took 4035.98 ms. Allocated memory was 141.6 MB in the beginning and 254.8 MB in the end (delta: 113.2 MB). Free memory was 87.2 MB in the beginning and 165.9 MB in the end (delta: -78.7 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,719 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.31 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 87.0 MB in the beginning and 177.9 MB in the end (delta: -90.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,723 INFO L168 Benchmark]: Boogie Preprocessor took 36.97 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 176.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,724 INFO L168 Benchmark]: RCFGBuilder took 397.87 ms. Allocated memory is still 201.3 MB. Free memory was 176.3 MB in the beginning and 158.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,730 INFO L168 Benchmark]: TraceAbstraction took 3205.42 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 158.4 MB in the beginning and 165.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:46,737 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 141.6 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.31 ms. Allocated memory was 141.6 MB in the beginning and 201.3 MB in the end (delta: 59.8 MB). Free memory was 87.0 MB in the beginning and 177.9 MB in the end (delta: -90.9 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.97 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 176.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.87 ms. Allocated memory is still 201.3 MB. Free memory was 176.3 MB in the beginning and 158.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3205.42 ms. Allocated memory was 201.3 MB in the beginning and 254.8 MB in the end (delta: 53.5 MB). Free memory was 158.4 MB in the beginning and 165.9 MB in the end (delta: -7.5 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 3.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 149 SDslu, 245 SDs, 0 SdLazy, 102 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9761904761904762 AbsIntWeakeningRatio, 1.5238095238095237 AbsIntAvgWeakeningVarsNumRemoved, 1.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 45717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...