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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:03:54,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:03:54,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:03:54,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:03:54,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:03:54,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:03:54,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:03:54,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:03:54,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:03:54,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:03:54,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:03:54,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:03:54,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:03:54,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:03:54,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:03:54,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:03:54,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:03:54,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:03:54,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:03:54,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:03:54,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:03:54,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:03:54,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:03:54,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:03:54,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:03:54,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:03:54,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:03:54,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:03:54,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:03:54,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:03:54,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:03:54,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:03:54,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:03:54,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:03:54,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:03:54,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:03:54,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:03:54,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:03:54,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:03:54,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:03:54,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:03:54,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:03:54,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:03:54,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:03:54,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:03:54,673 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:03:54,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:03:54,673 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:03:54,674 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:03:54,674 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:03:54,674 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:03:54,674 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:03:54,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:03:54,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:03:54,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:03:54,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:03:54,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:03:54,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:03:54,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:03:54,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:03:54,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:03:54,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:03:54,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:03:54,679 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:03:54,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:03:54,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:03:54,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:03:54,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:03:54,680 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:03:54,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:03:54,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:03:54,681 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:03:54,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:03:54,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:03:54,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:03:54,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:03:54,730 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:03:54,731 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+lhb-reducer.c [2019-09-10 02:03:54,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8013d141b/3e77241af56845028ed49ef9e2e6ab50/FLAG485c63ae8 [2019-09-10 02:03:55,197 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:03:55,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-10 02:03:55,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8013d141b/3e77241af56845028ed49ef9e2e6ab50/FLAG485c63ae8 [2019-09-10 02:03:55,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8013d141b/3e77241af56845028ed49ef9e2e6ab50 [2019-09-10 02:03:55,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:03:55,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:03:55,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:03:55,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:03:55,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:03:55,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:03:55" (1/1) ... [2019-09-10 02:03:55,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f255d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:55, skipping insertion in model container [2019-09-10 02:03:55,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:03:55" (1/1) ... [2019-09-10 02:03:55,634 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:03:55,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:03:55,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:03:55,858 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:03:55,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:03:56,000 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:03:56,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56 WrapperNode [2019-09-10 02:03:56,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:03:56,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:03:56,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:03:56,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:03:56,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... [2019-09-10 02:03:56,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:03:56,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:03:56,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:03:56,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:03:56,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:03:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:03:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:03:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:03:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:03:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:03:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:03:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:03:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:03:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:03:56,455 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:03:56,456 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:03:56,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:03:56 BoogieIcfgContainer [2019-09-10 02:03:56,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:03:56,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:03:56,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:03:56,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:03:56,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:03:55" (1/3) ... [2019-09-10 02:03:56,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1984f4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:03:56, skipping insertion in model container [2019-09-10 02:03:56,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:03:56" (2/3) ... [2019-09-10 02:03:56,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1984f4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:03:56, skipping insertion in model container [2019-09-10 02:03:56,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:03:56" (3/3) ... [2019-09-10 02:03:56,463 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-10 02:03:56,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:03:56,477 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-10 02:03:56,492 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-10 02:03:56,518 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:03:56,518 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:03:56,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:03:56,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:03:56,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:03:56,519 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:03:56,519 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:03:56,519 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:03:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-10 02:03:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:03:56,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:56,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:56,547 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-10 02:03:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:03:56,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:56,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:03:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:03:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:56,782 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-10 02:03:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:56,843 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-10 02:03:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:03:56,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 02:03:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:56,861 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:03:56,861 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:03:56,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:03:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-10 02:03:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-10 02:03:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-10 02:03:56,911 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-10 02:03:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:56,912 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-10 02:03:56,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:03:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-10 02:03:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:03:56,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:56,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:56,915 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:56,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-10 02:03:56,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:56,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:56,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:57,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:03:57,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:57,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:03:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:03:57,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:03:57,008 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-10 02:03:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:57,069 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-10 02:03:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:03:57,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-10 02:03:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:57,072 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:03:57,073 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:03:57,074 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-10 02:03:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:03:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-10 02:03:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:03:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-10 02:03:57,084 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-10 02:03:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:57,084 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-10 02:03:57,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:03:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-10 02:03:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:03:57,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:57,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:57,086 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-10 02:03:57,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:57,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:03:57,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:57,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:03:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:03:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:57,149 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-10 02:03:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:57,184 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-10 02:03:57,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:03:57,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-10 02:03:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:57,186 INFO L225 Difference]: With dead ends: 41 [2019-09-10 02:03:57,186 INFO L226 Difference]: Without dead ends: 41 [2019-09-10 02:03:57,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-10 02:03:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-10 02:03:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 02:03:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-10 02:03:57,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-10 02:03:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:57,192 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-10 02:03:57,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:03:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-10 02:03:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:03:57,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:57,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:57,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-10 02:03:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:03:57,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:57,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:03:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:03:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:57,229 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-10 02:03:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:57,270 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 02:03:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:03:57,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-10 02:03:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:57,272 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:03:57,272 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 02:03:57,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:03:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 02:03:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-10 02:03:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:03:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-10 02:03:57,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-10 02:03:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:57,276 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-10 02:03:57,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:03:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-10 02:03:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:03:57,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:57,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:03:57,278 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-10 02:03:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:57,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:57,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:57,834 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2019-09-10 02:03:58,134 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 40 [2019-09-10 02:03:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:58,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:58,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:03:58,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:58,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:03:58,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:03:58,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:03:58,207 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-09-10 02:03:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:58,544 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-10 02:03:58,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:03:58,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-10 02:03:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:58,545 INFO L225 Difference]: With dead ends: 31 [2019-09-10 02:03:58,545 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 02:03:58,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:03:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 02:03:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-10 02:03:58,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 02:03:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-10 02:03:58,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-10 02:03:58,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:58,550 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-10 02:03:58,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:03:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-10 02:03:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:03:58,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:58,551 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-10 02:03:58,552 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-10 02:03:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:58,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:03:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:03:58,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:03:58,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:03:58,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:03:58,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:03:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:03:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:03:58,605 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-10 02:03:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:03:58,675 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-10 02:03:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:03:58,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-10 02:03:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:03:58,677 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:03:58,678 INFO L226 Difference]: Without dead ends: 42 [2019-09-10 02:03:58,678 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-10 02:03:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-10 02:03:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-10 02:03:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:03:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-10 02:03:58,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-10 02:03:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:03:58,684 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-10 02:03:58,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:03:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-10 02:03:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 02:03:58,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:03:58,688 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, 1] [2019-09-10 02:03:58,689 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:03:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:03:58,689 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-10 02:03:58,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:03:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:58,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:03:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:03:58,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:03:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:01,033 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-10 02:04:01,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:01,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:01,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-10 02:04:01,036 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2019-09-10 02:04:01,083 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:01,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:01,187 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:04:01,189 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-10 02:04:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:01,194 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:04:01,229 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 02:04:01,230 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:04:01,232 INFO L420 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-09-10 02:04:01,232 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:04:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:04:01,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:04:01,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:01,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:04:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:04:01,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:04:01,234 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-09-10 02:04:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:01,235 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 02:04:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:04:01,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-09-10 02:04:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:01,236 INFO L225 Difference]: With dead ends: 6 [2019-09-10 02:04:01,236 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:01,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-10 02:04:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:01,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-10 02:04:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:01,238 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:01,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:04:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:01,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:01,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:01 BoogieIcfgContainer [2019-09-10 02:04:01,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:01,246 INFO L168 Benchmark]: Toolchain (without parser) took 5626.24 ms. Allocated memory was 134.2 MB in the beginning and 226.5 MB in the end (delta: 92.3 MB). Free memory was 89.6 MB in the beginning and 81.9 MB in the end (delta: 7.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,247 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.42 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 89.4 MB in the beginning and 175.3 MB in the end (delta: -85.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,249 INFO L168 Benchmark]: Boogie Preprocessor took 37.42 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 173.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,249 INFO L168 Benchmark]: RCFGBuilder took 418.51 ms. Allocated memory is still 199.8 MB. Free memory was 173.5 MB in the beginning and 153.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,250 INFO L168 Benchmark]: TraceAbstraction took 4786.00 ms. Allocated memory was 199.8 MB in the beginning and 226.5 MB in the end (delta: 26.7 MB). Free memory was 153.1 MB in the beginning and 81.9 MB in the end (delta: 71.2 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:01,255 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.19 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 380.42 ms. Allocated memory was 134.2 MB in the beginning and 199.8 MB in the end (delta: 65.5 MB). Free memory was 89.4 MB in the beginning and 175.3 MB in the end (delta: -85.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.42 ms. Allocated memory is still 199.8 MB. Free memory was 175.3 MB in the beginning and 173.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.51 ms. Allocated memory is still 199.8 MB. Free memory was 173.5 MB in the beginning and 153.7 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4786.00 ms. Allocated memory was 199.8 MB in the beginning and 226.5 MB in the end (delta: 26.7 MB). Free memory was 153.1 MB in the beginning and 81.9 MB in the end (delta: 71.2 MB). Peak memory consumption was 97.9 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: 104]: 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 - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 4.7s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 155 SDslu, 250 SDs, 0 SdLazy, 105 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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.9772727272727273 AbsIntWeakeningRatio, 1.4545454545454546 AbsIntAvgWeakeningVarsNumRemoved, 0.9545454545454546 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 22567 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...