java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 09:39:45,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 09:39:45,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 09:39:45,737 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 09:39:45,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 09:39:45,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 09:39:45,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 09:39:45,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 09:39:45,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 09:39:45,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 09:39:45,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 09:39:45,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 09:39:45,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 09:39:45,746 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 09:39:45,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 09:39:45,748 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 09:39:45,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 09:39:45,750 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 09:39:45,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 09:39:45,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 09:39:45,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 09:39:45,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 09:39:45,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 09:39:45,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 09:39:45,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 09:39:45,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 09:39:45,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 09:39:45,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 09:39:45,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 09:39:45,767 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 09:39:45,767 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 09:39:45,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 09:39:45,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 09:39:45,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 09:39:45,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 09:39:45,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 09:39:45,772 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 09:39:45,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 09:39:45,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 09:39:45,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 09:39:45,806 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 09:39:45,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 09:39:45,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 09:39:45,807 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 09:39:45,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 09:39:45,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 09:39:45,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 09:39:45,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 09:39:45,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 09:39:45,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 09:39:45,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 09:39:45,808 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 09:39:45,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 09:39:45,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 09:39:45,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 09:39:45,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 09:39:45,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:45,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 09:39:45,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 09:39:45,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 09:39:45,811 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 09:39:45,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 09:39:45,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 09:39:45,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 09:39:45,812 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 09:39:45,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 09:39:45,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 09:39:45,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 09:39:45,902 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 09:39:45,902 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 09:39:45,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 09:39:45,964 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dbcb1d1b0/16df008bf54243fa869984ad6ae45fc7/FLAG60f274b8e [2018-10-23 09:39:46,416 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 09:39:46,417 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 09:39:46,433 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dbcb1d1b0/16df008bf54243fa869984ad6ae45fc7/FLAG60f274b8e [2018-10-23 09:39:46,453 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/dbcb1d1b0/16df008bf54243fa869984ad6ae45fc7 [2018-10-23 09:39:46,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 09:39:46,467 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 09:39:46,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:46,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 09:39:46,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 09:39:46,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1304d0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46, skipping insertion in model container [2018-10-23 09:39:46,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 09:39:46,538 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 09:39:46,754 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:46,760 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 09:39:46,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:46,831 INFO L193 MainTranslator]: Completed translation [2018-10-23 09:39:46,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46 WrapperNode [2018-10-23 09:39:46,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:46,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:46,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 09:39:46,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 09:39:46,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:46,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 09:39:46,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 09:39:46,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 09:39:46,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... [2018-10-23 09:39:46,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 09:39:46,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 09:39:46,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 09:39:46,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 09:39:46,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:47,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 09:39:47,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 09:39:47,612 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 09:39:47,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:47 BoogieIcfgContainer [2018-10-23 09:39:47,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 09:39:47,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 09:39:47,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 09:39:47,617 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 09:39:47,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:39:46" (1/3) ... [2018-10-23 09:39:47,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f91ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:47, skipping insertion in model container [2018-10-23 09:39:47,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:46" (2/3) ... [2018-10-23 09:39:47,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f91ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:47, skipping insertion in model container [2018-10-23 09:39:47,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:47" (3/3) ... [2018-10-23 09:39:47,621 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 09:39:47,631 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 09:39:47,639 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-23 09:39:47,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-23 09:39:47,689 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 09:39:47,690 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 09:39:47,690 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 09:39:47,690 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 09:39:47,690 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 09:39:47,690 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 09:39:47,691 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 09:39:47,691 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 09:39:47,691 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 09:39:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-10-23 09:39:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-23 09:39:47,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:47,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:47,721 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:47,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2018-10-23 09:39:47,734 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:48,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:48,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:48,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:48,158 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-10-23 09:39:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:48,924 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-10-23 09:39:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:48,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-23 09:39:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:48,936 INFO L225 Difference]: With dead ends: 125 [2018-10-23 09:39:48,937 INFO L226 Difference]: Without dead ends: 109 [2018-10-23 09:39:48,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-23 09:39:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2018-10-23 09:39:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-23 09:39:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-10-23 09:39:48,979 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2018-10-23 09:39:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:48,980 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-10-23 09:39:48,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-10-23 09:39:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-23 09:39:48,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:48,981 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:48,982 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:48,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:48,982 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2018-10-23 09:39:48,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:48,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:48,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:49,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:49,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 09:39:49,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 09:39:49,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 09:39:49,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-23 09:39:49,038 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2018-10-23 09:39:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:49,175 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-10-23 09:39:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 09:39:49,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-23 09:39:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:49,185 INFO L225 Difference]: With dead ends: 65 [2018-10-23 09:39:49,185 INFO L226 Difference]: Without dead ends: 63 [2018-10-23 09:39:49,186 INFO L605 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 [2018-10-23 09:39:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-23 09:39:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-23 09:39:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-23 09:39:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-10-23 09:39:49,206 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2018-10-23 09:39:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:49,206 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-10-23 09:39:49,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 09:39:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-10-23 09:39:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-23 09:39:49,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:49,208 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:49,208 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:49,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2018-10-23 09:39:49,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:49,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:49,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:49,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 09:39:49,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 09:39:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 09:39:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:49,330 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2018-10-23 09:39:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:49,787 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-23 09:39:49,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:49,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-23 09:39:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:49,790 INFO L225 Difference]: With dead ends: 69 [2018-10-23 09:39:49,790 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 09:39:49,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 09:39:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-23 09:39:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-23 09:39:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-10-23 09:39:49,799 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2018-10-23 09:39:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:49,800 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-10-23 09:39:49,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 09:39:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-10-23 09:39:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:39:49,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:49,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:49,802 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:49,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2018-10-23 09:39:49,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:49,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:49,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:49,896 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-10-23 09:39:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:50,195 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-10-23 09:39:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:50,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-23 09:39:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:50,200 INFO L225 Difference]: With dead ends: 103 [2018-10-23 09:39:50,200 INFO L226 Difference]: Without dead ends: 101 [2018-10-23 09:39:50,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-23 09:39:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2018-10-23 09:39:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-23 09:39:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-10-23 09:39:50,209 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2018-10-23 09:39:50,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:50,209 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-10-23 09:39:50,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-10-23 09:39:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:39:50,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:50,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:50,211 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:50,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2018-10-23 09:39:50,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:50,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:50,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:50,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:50,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:50,302 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-10-23 09:39:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:50,495 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-10-23 09:39:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:50,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-23 09:39:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:50,496 INFO L225 Difference]: With dead ends: 65 [2018-10-23 09:39:50,496 INFO L226 Difference]: Without dead ends: 63 [2018-10-23 09:39:50,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-23 09:39:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-23 09:39:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-23 09:39:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-10-23 09:39:50,504 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2018-10-23 09:39:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:50,505 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-10-23 09:39:50,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-10-23 09:39:50,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:50,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:50,506 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:50,507 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:50,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:50,507 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2018-10-23 09:39:50,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:50,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:50,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:50,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:50,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:50,582 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-10-23 09:39:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,400 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-10-23 09:39:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:51,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,402 INFO L225 Difference]: With dead ends: 97 [2018-10-23 09:39:51,402 INFO L226 Difference]: Without dead ends: 93 [2018-10-23 09:39:51,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-23 09:39:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 58. [2018-10-23 09:39:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-23 09:39:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-10-23 09:39:51,413 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2018-10-23 09:39:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,414 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-10-23 09:39:51,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-10-23 09:39:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:51,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,416 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,417 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2018-10-23 09:39:51,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:51,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:51,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:51,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:51,514 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-10-23 09:39:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,715 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-10-23 09:39:51,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:51,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,717 INFO L225 Difference]: With dead ends: 134 [2018-10-23 09:39:51,717 INFO L226 Difference]: Without dead ends: 132 [2018-10-23 09:39:51,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-23 09:39:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 56. [2018-10-23 09:39:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-23 09:39:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-23 09:39:51,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2018-10-23 09:39:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,727 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-23 09:39:51,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-23 09:39:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:51,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,730 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,730 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2018-10-23 09:39:51,730 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:51,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:51,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:51,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:51,801 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-10-23 09:39:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:51,974 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-10-23 09:39:51,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:51,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:51,976 INFO L225 Difference]: With dead ends: 57 [2018-10-23 09:39:51,976 INFO L226 Difference]: Without dead ends: 53 [2018-10-23 09:39:51,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-23 09:39:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-23 09:39:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-23 09:39:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-23 09:39:51,984 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2018-10-23 09:39:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:51,984 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-23 09:39:51,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-23 09:39:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:51,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:51,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:51,986 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:51,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2018-10-23 09:39:51,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:51,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:52,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:52,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:52,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:52,151 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 9 states. [2018-10-23 09:39:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:52,448 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-10-23 09:39:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:52,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-23 09:39:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:52,450 INFO L225 Difference]: With dead ends: 91 [2018-10-23 09:39:52,451 INFO L226 Difference]: Without dead ends: 89 [2018-10-23 09:39:52,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-23 09:39:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-10-23 09:39:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-23 09:39:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-23 09:39:52,458 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2018-10-23 09:39:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:52,458 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-23 09:39:52,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-23 09:39:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:52,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:52,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:52,460 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:52,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2018-10-23 09:39:52,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:52,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:52,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:52,517 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2018-10-23 09:39:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:52,669 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-10-23 09:39:52,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:52,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:52,671 INFO L225 Difference]: With dead ends: 68 [2018-10-23 09:39:52,671 INFO L226 Difference]: Without dead ends: 66 [2018-10-23 09:39:52,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-23 09:39:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-10-23 09:39:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-23 09:39:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-10-23 09:39:52,678 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2018-10-23 09:39:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:52,679 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-10-23 09:39:52,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-10-23 09:39:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:52,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:52,680 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:52,681 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:52,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2018-10-23 09:39:52,681 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:52,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:52,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:52,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:52,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:52,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:52,856 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2018-10-23 09:39:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:53,036 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-10-23 09:39:53,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:53,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:53,037 INFO L225 Difference]: With dead ends: 49 [2018-10-23 09:39:53,037 INFO L226 Difference]: Without dead ends: 47 [2018-10-23 09:39:53,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-23 09:39:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-23 09:39:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-23 09:39:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-23 09:39:53,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2018-10-23 09:39:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:53,043 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-23 09:39:53,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-23 09:39:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:53,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:53,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:53,045 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:53,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2018-10-23 09:39:53,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:53,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 09:39:53,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 09:39:53,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 09:39:53,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:53,194 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2018-10-23 09:39:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:53,483 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-10-23 09:39:53,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:53,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-10-23 09:39:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:53,485 INFO L225 Difference]: With dead ends: 47 [2018-10-23 09:39:53,485 INFO L226 Difference]: Without dead ends: 45 [2018-10-23 09:39:53,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-23 09:39:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-10-23 09:39:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-23 09:39:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-23 09:39:53,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-10-23 09:39:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:53,495 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-23 09:39:53,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 09:39:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-23 09:39:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:53,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:53,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:53,497 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:53,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2018-10-23 09:39:53,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:53,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:53,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:53,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:53,617 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-10-23 09:39:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:54,075 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-10-23 09:39:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:54,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-23 09:39:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:54,077 INFO L225 Difference]: With dead ends: 57 [2018-10-23 09:39:54,077 INFO L226 Difference]: Without dead ends: 55 [2018-10-23 09:39:54,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-23 09:39:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-23 09:39:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2018-10-23 09:39:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-23 09:39:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-10-23 09:39:54,083 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2018-10-23 09:39:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:54,083 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-10-23 09:39:54,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-10-23 09:39:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:54,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:54,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:54,085 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:54,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:54,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2018-10-23 09:39:54,086 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:54,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:54,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:54,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:54,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:54,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:54,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:54,450 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2018-10-23 09:39:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:54,616 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-10-23 09:39:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:54,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-10-23 09:39:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:54,618 INFO L225 Difference]: With dead ends: 61 [2018-10-23 09:39:54,618 INFO L226 Difference]: Without dead ends: 59 [2018-10-23 09:39:54,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-23 09:39:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2018-10-23 09:39:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-23 09:39:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-23 09:39:54,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2018-10-23 09:39:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:54,625 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-23 09:39:54,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-23 09:39:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:54,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:54,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:54,626 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:54,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2018-10-23 09:39:54,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:54,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:54,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:54,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:54,772 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-10-23 09:39:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:54,938 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-10-23 09:39:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:54,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-23 09:39:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:54,940 INFO L225 Difference]: With dead ends: 37 [2018-10-23 09:39:54,940 INFO L226 Difference]: Without dead ends: 33 [2018-10-23 09:39:54,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-23 09:39:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-23 09:39:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-23 09:39:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-23 09:39:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-23 09:39:54,947 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-10-23 09:39:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:54,947 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-23 09:39:54,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-23 09:39:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 09:39:54,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:54,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:54,949 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:54,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2018-10-23 09:39:54,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:54,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:55,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:55,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:55,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:55,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:55,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:55,082 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-10-23 09:39:55,374 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-10-23 09:39:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:55,502 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-10-23 09:39:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:55,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-10-23 09:39:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:55,503 INFO L225 Difference]: With dead ends: 48 [2018-10-23 09:39:55,503 INFO L226 Difference]: Without dead ends: 46 [2018-10-23 09:39:55,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-23 09:39:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-23 09:39:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2018-10-23 09:39:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-23 09:39:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-10-23 09:39:55,508 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2018-10-23 09:39:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:55,509 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-23 09:39:55,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-10-23 09:39:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 09:39:55,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:55,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:55,510 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:55,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2018-10-23 09:39:55,511 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:55,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:55,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:55,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:55,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:55,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:55,885 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2018-10-23 09:39:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:56,032 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-10-23 09:39:56,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:56,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-10-23 09:39:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:56,034 INFO L225 Difference]: With dead ends: 35 [2018-10-23 09:39:56,034 INFO L226 Difference]: Without dead ends: 33 [2018-10-23 09:39:56,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-23 09:39:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-10-23 09:39:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-23 09:39:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-10-23 09:39:56,040 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2018-10-23 09:39:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:56,041 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-10-23 09:39:56,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-10-23 09:39:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 09:39:56,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:56,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:56,042 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:56,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:56,042 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2018-10-23 09:39:56,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:56,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:56,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:56,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:56,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:56,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:56,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:56,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:56,123 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2018-10-23 09:39:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:56,498 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-10-23 09:39:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:56,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-23 09:39:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:56,499 INFO L225 Difference]: With dead ends: 33 [2018-10-23 09:39:56,499 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 09:39:56,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 09:39:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 09:39:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 09:39:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 09:39:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 09:39:56,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-10-23 09:39:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:56,501 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 09:39:56,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 09:39:56,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 09:39:56,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 09:39:57,341 WARN L179 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 14 [2018-10-23 09:39:57,582 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 13 [2018-10-23 09:39:57,853 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2018-10-23 09:39:57,856 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-10-23 09:39:57,856 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-10-23 09:39:57,856 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-10-23 09:39:57,857 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-10-23 09:39:57,858 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-10-23 09:39:57,859 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-10-23 09:39:57,859 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-10-23 09:39:57,859 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-10-23 09:39:57,859 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-10-23 09:39:57,859 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-10-23 09:39:57,860 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-10-23 09:39:57,860 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-10-23 09:39:57,860 INFO L428 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2018-10-23 09:39:57,860 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-10-23 09:39:57,860 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-10-23 09:39:57,860 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-10-23 09:39:57,860 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-10-23 09:39:57,861 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-10-23 09:39:57,861 INFO L421 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 0 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 1)) [2018-10-23 09:39:57,861 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-10-23 09:39:57,861 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-10-23 09:39:57,861 INFO L421 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-10-23 09:39:57,862 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-10-23 09:39:57,863 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-10-23 09:39:57,864 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-10-23 09:39:57,865 INFO L421 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2018-10-23 09:39:57,866 INFO L421 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2018-10-23 09:39:57,866 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-10-23 09:39:57,866 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-23 09:39:57,866 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-23 09:39:57,866 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-10-23 09:39:57,866 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-10-23 09:39:57,867 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-10-23 09:39:57,867 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-10-23 09:39:57,867 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-10-23 09:39:57,867 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-10-23 09:39:57,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:39:57 BoogieIcfgContainer [2018-10-23 09:39:57,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 09:39:57,891 INFO L168 Benchmark]: Toolchain (without parser) took 11426.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -177.4 MB). Peak memory consumption was 551.4 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:57,893 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:57,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:57,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:57,895 INFO L168 Benchmark]: Boogie Preprocessor took 24.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:57,895 INFO L168 Benchmark]: RCFGBuilder took 711.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:57,896 INFO L168 Benchmark]: TraceAbstraction took 10276.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 572.5 MB). Peak memory consumption was 572.5 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:57,901 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 711.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -760.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10276.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 572.5 MB). Peak memory consumption was 572.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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 - PositiveResult [Line: 51]: 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: 274]: 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: 184]: 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: 138]: 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: 39]: 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: 68]: 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: 334]: 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 - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t + 1 <= main__tagbuf_len) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) && __VERIFIER_assert__cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. SAFE Result, 10.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 752 SDtfs, 2026 SDslu, 1126 SDs, 0 SdLazy, 1560 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 314 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 61 HoareAnnotationTreeSize, 6 FomulaSimplifications, 281084 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1572 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7863 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...