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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:18:03,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:18:03,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:18:03,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:18:03,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:18:03,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:18:03,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:18:03,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:18:03,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:18:03,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:18:03,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:18:03,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:18:03,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:18:03,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:18:03,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:18:03,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:18:03,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:18:03,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:18:03,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:18:03,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:18:03,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:18:03,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:18:03,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:18:03,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:18:03,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:18:03,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:18:03,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:18:03,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:18:03,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:18:03,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:18:03,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:18:03,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:18:03,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:18:03,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:18:03,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:18:03,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:18:03,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:18:03,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:18:03,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:18:03,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:18:03,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:18:03,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:18:03,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:18:03,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:18:03,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:18:03,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:18:03,583 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:18:03,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:18:03,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:18:03,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:18:03,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:18:03,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:18:03,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:18:03,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:18:03,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:18:03,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:18:03,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:18:03,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:18:03,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:18:03,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:18:03,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:18:03,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:18:03,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:18:03,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:18:03,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:18:03,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:18:03,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:18:03,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:18:03,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:18:03,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:18:03,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:18:03,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:18:03,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:18:03,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:18:03,633 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:18:03,634 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:18:03,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-02 11:18:03,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85b859f8/68607b9a1cd244f4a5b5625444e39355/FLAGfe0da43d2 [2019-10-02 11:18:04,132 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:18:04,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-02 11:18:04,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85b859f8/68607b9a1cd244f4a5b5625444e39355/FLAGfe0da43d2 [2019-10-02 11:18:04,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85b859f8/68607b9a1cd244f4a5b5625444e39355 [2019-10-02 11:18:04,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:18:04,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:18:04,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:04,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:18:04,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:18:04,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:04" (1/1) ... [2019-10-02 11:18:04,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d82875c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:04, skipping insertion in model container [2019-10-02 11:18:04,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:18:04" (1/1) ... [2019-10-02 11:18:04,560 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:18:04,616 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:18:04,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:04,885 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:18:05,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:18:05,041 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:18:05,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05 WrapperNode [2019-10-02 11:18:05,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:18:05,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:18:05,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:18:05,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:18:05,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (1/1) ... [2019-10-02 11:18:05,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:18:05,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:18:05,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:18:05,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:18:05,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (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-10-02 11:18:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:18:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:18:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:18:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:18:05,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:18:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:18:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:18:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:18:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:18:05,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:18:05,598 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:18:05,598 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 11:18:05,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:05 BoogieIcfgContainer [2019-10-02 11:18:05,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:18:05,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:18:05,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:18:05,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:18:05,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:18:04" (1/3) ... [2019-10-02 11:18:05,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2057d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:05, skipping insertion in model container [2019-10-02 11:18:05,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:18:05" (2/3) ... [2019-10-02 11:18:05,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2057d377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:18:05, skipping insertion in model container [2019-10-02 11:18:05,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:18:05" (3/3) ... [2019-10-02 11:18:05,621 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-10-02 11:18:05,634 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:18:05,644 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-02 11:18:05,661 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-02 11:18:05,690 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:18:05,690 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:18:05,691 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:18:05,691 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:18:05,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:18:05,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:18:05,694 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:18:05,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:18:05,694 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:18:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-02 11:18:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:18:05,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:05,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:05,719 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-10-02 11:18:05,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:05,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:05,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:05,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:05,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:05,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:05,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:05,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:05,932 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-10-02 11:18:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,104 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2019-10-02 11:18:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:06,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:18:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,118 INFO L225 Difference]: With dead ends: 133 [2019-10-02 11:18:06,118 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 11:18:06,122 INFO L640 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-10-02 11:18:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 11:18:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-10-02 11:18:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-02 11:18:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-02 11:18:06,172 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-10-02 11:18:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,172 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-02 11:18:06,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:06,173 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-02 11:18:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-02 11:18:06,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,175 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-10-02 11:18:06,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:06,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:06,230 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-10-02 11:18:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,309 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-02 11:18:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:06,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-02 11:18:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,312 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:18:06,312 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:18:06,313 INFO L640 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-10-02 11:18:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:18:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-02 11:18:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:18:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-02 11:18:06,322 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-10-02 11:18:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-02 11:18:06,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-02 11:18:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:18:06,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,325 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-10-02 11:18:06,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:06,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:06,379 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-10-02 11:18:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,469 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-02 11:18:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:06,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-02 11:18:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,473 INFO L225 Difference]: With dead ends: 73 [2019-10-02 11:18:06,473 INFO L226 Difference]: Without dead ends: 71 [2019-10-02 11:18:06,474 INFO L640 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-10-02 11:18:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-02 11:18:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-10-02 11:18:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-02 11:18:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-02 11:18:06,484 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-10-02 11:18:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,485 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-02 11:18:06,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-02 11:18:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:18:06,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,489 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-10-02 11:18:06,490 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:06,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:06,582 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-10-02 11:18:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,706 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-02 11:18:06,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:06,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-02 11:18:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,708 INFO L225 Difference]: With dead ends: 71 [2019-10-02 11:18:06,708 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 11:18:06,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 11:18:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-10-02 11:18:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-02 11:18:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-02 11:18:06,721 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-10-02 11:18:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,721 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-02 11:18:06,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-02 11:18:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-02 11:18:06,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-10-02 11:18:06,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:06,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:06,811 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-10-02 11:18:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:06,894 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-10-02 11:18:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:06,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-02 11:18:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:06,896 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:18:06,896 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:18:06,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:18:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-10-02 11:18:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-02 11:18:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-02 11:18:06,903 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-10-02 11:18:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:06,904 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-02 11:18:06,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-02 11:18:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:18:06,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:06,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:06,906 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:06,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-10-02 11:18:06,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:06,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:06,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:06,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:06,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:06,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:06,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:06,962 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-02 11:18:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,087 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-10-02 11:18:07,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:07,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-02 11:18:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,089 INFO L225 Difference]: With dead ends: 112 [2019-10-02 11:18:07,089 INFO L226 Difference]: Without dead ends: 110 [2019-10-02 11:18:07,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-02 11:18:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-10-02 11:18:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 11:18:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-02 11:18:07,109 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-10-02 11:18:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,110 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-02 11:18:07,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-02 11:18:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:18:07,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-10-02 11:18:07,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:07,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:07,175 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-10-02 11:18:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,234 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-02 11:18:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:07,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 11:18:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,239 INFO L225 Difference]: With dead ends: 65 [2019-10-02 11:18:07,239 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 11:18:07,240 INFO L640 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-10-02 11:18:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 11:18:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-02 11:18:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-02 11:18:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-10-02 11:18:07,246 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-10-02 11:18:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,246 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-10-02 11:18:07,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-10-02 11:18:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 11:18:07,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,248 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-10-02 11:18:07,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:07,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:07,297 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-10-02 11:18:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,360 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-02 11:18:07,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:07,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 11:18:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,362 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:18:07,362 INFO L226 Difference]: Without dead ends: 57 [2019-10-02 11:18:07,363 INFO L640 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-10-02 11:18:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-02 11:18:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-10-02 11:18:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-02 11:18:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-02 11:18:07,368 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-10-02 11:18:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,368 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-02 11:18:07,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-02 11:18:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:07,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,370 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-10-02 11:18:07,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:07,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,422 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-10-02 11:18:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,530 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-10-02 11:18:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:07,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,532 INFO L225 Difference]: With dead ends: 95 [2019-10-02 11:18:07,532 INFO L226 Difference]: Without dead ends: 93 [2019-10-02 11:18:07,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-02 11:18:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-10-02 11:18:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:18:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-02 11:18:07,545 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-10-02 11:18:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,545 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-02 11:18:07,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-02 11:18:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:07,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-10-02 11:18:07,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:07,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:07,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,599 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-10-02 11:18:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,695 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-10-02 11:18:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:07,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,698 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:18:07,698 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:18:07,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:18:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-10-02 11:18:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 11:18:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-02 11:18:07,708 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-10-02 11:18:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,709 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-02 11:18:07,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:07,709 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-02 11:18:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 11:18:07,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,716 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-10-02 11:18:07,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:07,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,778 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-10-02 11:18:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,843 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-10-02 11:18:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:07,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-02 11:18:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,845 INFO L225 Difference]: With dead ends: 53 [2019-10-02 11:18:07,845 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:18:07,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:18:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-10-02 11:18:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-02 11:18:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-02 11:18:07,850 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-10-02 11:18:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,850 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-02 11:18:07,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-02 11:18:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:07,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,852 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-10-02 11:18:07,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:07,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:07,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:07,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:07,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:07,895 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-10-02 11:18:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:07,964 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-10-02 11:18:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:07,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:07,966 INFO L225 Difference]: With dead ends: 50 [2019-10-02 11:18:07,966 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:18:07,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:18:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-10-02 11:18:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 11:18:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-02 11:18:07,970 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-02 11:18:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:07,970 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-02 11:18:07,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-02 11:18:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:07,971 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:07,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:07,972 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-10-02 11:18:07,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:07,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:07,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:08,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,001 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-10-02 11:18:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,082 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-02 11:18:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:08,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,083 INFO L225 Difference]: With dead ends: 69 [2019-10-02 11:18:08,084 INFO L226 Difference]: Without dead ends: 67 [2019-10-02 11:18:08,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-02 11:18:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-10-02 11:18:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:18:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 11:18:08,087 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-02 11:18:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,088 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 11:18:08,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 11:18:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:08,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,089 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-10-02 11:18:08,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:08,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:08,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,145 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-10-02 11:18:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,217 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-02 11:18:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:08,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,219 INFO L225 Difference]: With dead ends: 57 [2019-10-02 11:18:08,219 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 11:18:08,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 11:18:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-10-02 11:18:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:18:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-02 11:18:08,223 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-10-02 11:18:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,223 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-02 11:18:08,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-02 11:18:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:18:08,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,225 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-10-02 11:18:08,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:08,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,280 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-10-02 11:18:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,338 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-10-02 11:18:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:18:08,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-02 11:18:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,339 INFO L225 Difference]: With dead ends: 41 [2019-10-02 11:18:08,339 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 11:18:08,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 11:18:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-02 11:18:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 11:18:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-02 11:18:08,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-10-02 11:18:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,343 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-02 11:18:08,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-02 11:18:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:18:08,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,345 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-10-02 11:18:08,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:18:08,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:18:08,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:18:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:18:08,384 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-10-02 11:18:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,470 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-02 11:18:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:08,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-02 11:18:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,472 INFO L225 Difference]: With dead ends: 52 [2019-10-02 11:18:08,472 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 11:18:08,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 11:18:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-10-02 11:18:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 11:18:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-02 11:18:08,478 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-10-02 11:18:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,478 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-02 11:18:08,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:18:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-02 11:18:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:18:08,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:18:08,480 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-10-02 11:18:08,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:18:08,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:18:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:18:08,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:18:08,515 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-10-02 11:18:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,607 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-02 11:18:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:18:08,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:18:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,610 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:18:08,611 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 11:18:08,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:18:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 11:18:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-10-02 11:18:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:18:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-02 11:18:08,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-10-02 11:18:08,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,617 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-02 11:18:08,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:18:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-02 11:18:08,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:18:08,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:18:08,618 INFO L411 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-10-02 11:18:08,618 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:18:08,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:18:08,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-10-02 11:18:08,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:18:08,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:18:08,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:18:08,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:18:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:18:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:18:08,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:18:08,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:18:08,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:18:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:18:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:18:08,642 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-10-02 11:18:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:18:08,679 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-02 11:18:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:18:08,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-02 11:18:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:18:08,680 INFO L225 Difference]: With dead ends: 37 [2019-10-02 11:18:08,680 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:18:08,681 INFO L640 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-10-02 11:18:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:18:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:18:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:18:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:18:08,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-02 11:18:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:18:08,681 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:18:08,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:18:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:18:08,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:18:08,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:18:09,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:09,096 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:09,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:09,096 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:18:09,096 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:18:09,097 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-10-02 11:18:09,097 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-10-02 11:18:09,098 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-02 11:18:09,099 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-10-02 11:18:09,100 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-10-02 11:18:09,101 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-02 11:18:09,101 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-10-02 11:18:09,101 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-10-02 11:18:09,101 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-10-02 11:18:09,101 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-02 11:18:09,101 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-02 11:18:09,101 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-10-02 11:18:09,102 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-10-02 11:18:09,103 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-10-02 11:18:09,104 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-10-02 11:18:09,105 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-10-02 11:18:09,105 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-02 11:18:09,105 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-02 11:18:09,105 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-10-02 11:18:09,105 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-10-02 11:18:09,106 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-02 11:18:09,106 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-02 11:18:09,106 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-02 11:18:09,106 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-10-02 11:18:09,106 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-02 11:18:09,107 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-10-02 11:18:09,107 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-02 11:18:09,107 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-10-02 11:18:09,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:18:09 BoogieIcfgContainer [2019-10-02 11:18:09,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:18:09,132 INFO L168 Benchmark]: Toolchain (without parser) took 4587.38 ms. Allocated memory was 140.0 MB in the beginning and 259.5 MB in the end (delta: 119.5 MB). Free memory was 87.2 MB in the beginning and 187.2 MB in the end (delta: -100.0 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,133 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.91 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 87.0 MB in the beginning and 176.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,139 INFO L168 Benchmark]: Boogie Preprocessor took 33.97 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 174.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,140 INFO L168 Benchmark]: RCFGBuilder took 524.22 ms. Allocated memory is still 200.3 MB. Free memory was 174.7 MB in the beginning and 150.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,141 INFO L168 Benchmark]: TraceAbstraction took 3526.80 ms. Allocated memory was 200.3 MB in the beginning and 259.5 MB in the end (delta: 59.2 MB). Free memory was 150.6 MB in the beginning and 187.2 MB in the end (delta: -36.6 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:18:09,154 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.23 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 497.91 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 87.0 MB in the beginning and 176.6 MB in the end (delta: -89.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.97 ms. Allocated memory is still 200.3 MB. Free memory was 176.6 MB in the beginning and 174.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.22 ms. Allocated memory is still 200.3 MB. Free memory was 174.7 MB in the beginning and 150.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3526.80 ms. Allocated memory was 200.3 MB in the beginning and 259.5 MB in the end (delta: 59.2 MB). Free memory was 150.6 MB in the beginning and 187.2 MB in the end (delta: -36.6 MB). Peak memory consumption was 125.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: 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: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 3.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 801 SDtfs, 1294 SDslu, 816 SDs, 0 SdLazy, 999 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 63 HoareAnnotationTreeSize, 9 FomulaSimplifications, 144371 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3862 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 10044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...