java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:54:52,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:54:52,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:54:52,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:54:52,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:54:52,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:54:52,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:54:52,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:54:52,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:54:52,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:54:52,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:54:52,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:54:52,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:54:52,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:54:52,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:54:52,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:54:52,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:54:52,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:54:52,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:54:52,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:54:52,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:54:52,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:54:52,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:54:52,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:54:52,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:54:52,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:54:52,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:54:52,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:54:52,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:54:52,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:54:52,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:54:52,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:54:52,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:54:52,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:54:52,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:54:52,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:54:52,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:54:52,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:54:52,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:54:52,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:54:52,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:54:52,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:54:52,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:54:52,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:54:52,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:54:52,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:54:52,075 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:54:52,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:54:52,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:54:52,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:54:52,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:54:52,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:54:52,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:54:52,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:54:52,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:54:52,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:54:52,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:54:52,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:54:52,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:54:52,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:54:52,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:54:52,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:54:52,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:54:52,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:54:52,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:54:52,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:54:52,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:54:52,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:54:52,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:54:52,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:54:52,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:54:52,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:54:52,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:54:52,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:54:52,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:54:52,128 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:54:52,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-08 02:54:52,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0b0c7bb/519de07f1a304df1a5846821bfa48327/FLAGc8992b009 [2019-09-08 02:54:52,682 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:54:52,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-08 02:54:52,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0b0c7bb/519de07f1a304df1a5846821bfa48327/FLAGc8992b009 [2019-09-08 02:54:53,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0b0c7bb/519de07f1a304df1a5846821bfa48327 [2019-09-08 02:54:53,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:54:53,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:54:53,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:54:53,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:54:53,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:54:53,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1661dfe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53, skipping insertion in model container [2019-09-08 02:54:53,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,117 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:54:53,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:54:53,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:54:53,405 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:54:53,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:54:53,575 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:54:53,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53 WrapperNode [2019-09-08 02:54:53,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:54:53,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:54:53,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:54:53,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:54:53,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... [2019-09-08 02:54:53,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:54:53,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:54:53,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:54:53,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:54:53,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:54:53,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:54:53,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:54:53,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:54:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:54:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:54:54,062 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:54:54,063 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 02:54:54,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:54:54 BoogieIcfgContainer [2019-09-08 02:54:54,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:54:54,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:54:54,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:54:54,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:54:54,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:54:53" (1/3) ... [2019-09-08 02:54:54,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565c5e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:54:54, skipping insertion in model container [2019-09-08 02:54:54,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:54:53" (2/3) ... [2019-09-08 02:54:54,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565c5e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:54:54, skipping insertion in model container [2019-09-08 02:54:54,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:54:54" (3/3) ... [2019-09-08 02:54:54,071 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-08 02:54:54,080 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:54:54,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 02:54:54,109 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 02:54:54,144 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:54:54,145 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:54:54,145 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:54:54,145 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:54:54,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:54:54,146 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:54:54,146 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:54:54,146 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:54:54,146 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:54:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-08 02:54:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:54:54,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:54,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:54,175 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:54,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-09-08 02:54:54,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:54,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 02:54:54,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 02:54:54,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 02:54:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:54:54,356 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-09-08 02:54:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:54,396 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2019-09-08 02:54:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 02:54:54,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-08 02:54:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:54,406 INFO L225 Difference]: With dead ends: 88 [2019-09-08 02:54:54,406 INFO L226 Difference]: Without dead ends: 76 [2019-09-08 02:54:54,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 02:54:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-08 02:54:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-08 02:54:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 02:54:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-08 02:54:54,457 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-09-08 02:54:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:54,457 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-08 02:54:54,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 02:54:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-08 02:54:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:54:54,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:54,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:54,460 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:54,460 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-09-08 02:54:54,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:54,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:54,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:54,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:54,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:54,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:54,555 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-08 02:54:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:54,667 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-09-08 02:54:54,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:54:54,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 02:54:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:54,671 INFO L225 Difference]: With dead ends: 153 [2019-09-08 02:54:54,671 INFO L226 Difference]: Without dead ends: 101 [2019-09-08 02:54:54,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-08 02:54:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-09-08 02:54:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-08 02:54:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-08 02:54:54,686 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-09-08 02:54:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:54,687 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-08 02:54:54,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-08 02:54:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:54:54,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:54,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:54,689 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-09-08 02:54:54,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:54,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:54,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:54,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:54,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:54,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:54,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:54,746 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-09-08 02:54:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:54,855 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-09-08 02:54:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:54:54,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-08 02:54:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:54,858 INFO L225 Difference]: With dead ends: 75 [2019-09-08 02:54:54,858 INFO L226 Difference]: Without dead ends: 73 [2019-09-08 02:54:54,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-08 02:54:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-09-08 02:54:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:54:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-08 02:54:54,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-09-08 02:54:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:54,873 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-08 02:54:54,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-08 02:54:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:54:54,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:54,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:54,877 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:54,878 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-09-08 02:54:54,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:54,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:54,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:54,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:54,939 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-09-08 02:54:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,032 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-09-08 02:54:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:54:55,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-08 02:54:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,034 INFO L225 Difference]: With dead ends: 96 [2019-09-08 02:54:55,034 INFO L226 Difference]: Without dead ends: 94 [2019-09-08 02:54:55,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-08 02:54:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-09-08 02:54:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 02:54:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-08 02:54:55,044 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-09-08 02:54:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,044 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-08 02:54:55,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-08 02:54:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:54:55,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,046 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-09-08 02:54:55,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:54:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:54:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:54:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,111 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-08 02:54:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,231 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-09-08 02:54:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:54:55,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-08 02:54:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,235 INFO L225 Difference]: With dead ends: 95 [2019-09-08 02:54:55,235 INFO L226 Difference]: Without dead ends: 93 [2019-09-08 02:54:55,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:54:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-08 02:54:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-09-08 02:54:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 02:54:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-08 02:54:55,246 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-09-08 02:54:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,247 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-08 02:54:55,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:54:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-08 02:54:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:54:55,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,248 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,248 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-09-08 02:54:55,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:55,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:55,287 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-09-08 02:54:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,354 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-09-08 02:54:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:54:55,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-08 02:54:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,355 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:54:55,355 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:54:55,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:54:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-09-08 02:54:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 02:54:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-08 02:54:55,369 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-09-08 02:54:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,369 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-08 02:54:55,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-08 02:54:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:54:55,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,374 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-09-08 02:54:55,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:55,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:55,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:55,434 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-09-08 02:54:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,507 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-09-08 02:54:55,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:54:55,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-08 02:54:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,509 INFO L225 Difference]: With dead ends: 91 [2019-09-08 02:54:55,510 INFO L226 Difference]: Without dead ends: 89 [2019-09-08 02:54:55,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-08 02:54:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-09-08 02:54:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-08 02:54:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-08 02:54:55,522 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-09-08 02:54:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,524 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-08 02:54:55,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-08 02:54:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:54:55,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,526 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-09-08 02:54:55,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:54:55,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:54:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:54:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,603 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-09-08 02:54:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,725 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-09-08 02:54:55,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:54:55,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:54:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,726 INFO L225 Difference]: With dead ends: 73 [2019-09-08 02:54:55,726 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 02:54:55,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:54:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 02:54:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-09-08 02:54:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 02:54:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-08 02:54:55,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-09-08 02:54:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,742 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-08 02:54:55,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:54:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-08 02:54:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:54:55,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,744 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-09-08 02:54:55,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:54:55,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:54:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:54:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:55,821 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-09-08 02:54:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:55,909 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-09-08 02:54:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:54:55,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:54:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:55,910 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:54:55,910 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 02:54:55,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:54:55,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 02:54:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-09-08 02:54:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-08 02:54:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-08 02:54:55,919 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-09-08 02:54:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:55,919 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-08 02:54:55,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:54:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-08 02:54:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:54:55,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:55,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:55,923 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:55,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:55,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-09-08 02:54:55,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:55,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:55,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:55,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:55,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:55,989 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-09-08 02:54:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,043 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-09-08 02:54:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:54:56,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-08 02:54:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,045 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:54:56,045 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 02:54:56,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 02:54:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-08 02:54:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 02:54:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-08 02:54:56,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-09-08 02:54:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,055 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-08 02:54:56,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-08 02:54:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:54:56,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,060 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-09-08 02:54:56,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:54:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:54:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:54:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:54:56,101 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-09-08 02:54:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,161 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-09-08 02:54:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:54:56,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-08 02:54:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,163 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:54:56,163 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:54:56,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:54:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-09-08 02:54:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-08 02:54:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-08 02:54:56,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-09-08 02:54:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,178 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-08 02:54:56,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:54:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-08 02:54:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:54:56,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,180 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-09-08 02:54:56,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:54:56,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:54:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:54:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:56,253 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-09-08 02:54:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,361 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-09-08 02:54:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:54:56,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-08 02:54:56,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,363 INFO L225 Difference]: With dead ends: 74 [2019-09-08 02:54:56,363 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 02:54:56,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:54:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 02:54:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-09-08 02:54:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-08 02:54:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-08 02:54:56,369 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-09-08 02:54:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,369 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-08 02:54:56,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:54:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-08 02:54:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 02:54:56,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-09-08 02:54:56,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:54:56,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:54:56,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:54:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:54:56,422 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-09-08 02:54:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,548 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-08 02:54:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:54:56,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-08 02:54:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,550 INFO L225 Difference]: With dead ends: 62 [2019-09-08 02:54:56,550 INFO L226 Difference]: Without dead ends: 60 [2019-09-08 02:54:56,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:54:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-08 02:54:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-09-08 02:54:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-08 02:54:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-08 02:54:56,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-09-08 02:54:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,557 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-08 02:54:56,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:54:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-08 02:54:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-08 02:54:56,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,562 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,563 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-09-08 02:54:56,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:54:56,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:54:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:54:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:54:56,621 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-09-08 02:54:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,719 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-09-08 02:54:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:54:56,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-08 02:54:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,721 INFO L225 Difference]: With dead ends: 87 [2019-09-08 02:54:56,721 INFO L226 Difference]: Without dead ends: 85 [2019-09-08 02:54:56,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:54:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-08 02:54:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-09-08 02:54:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-08 02:54:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-08 02:54:56,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-09-08 02:54:56,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,726 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-08 02:54:56,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:54:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-08 02:54:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 02:54:56,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-09-08 02:54:56,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:54:56,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:54:56,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:54:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:54:56,774 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-09-08 02:54:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:56,891 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-08 02:54:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:54:56,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-08 02:54:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:56,892 INFO L225 Difference]: With dead ends: 60 [2019-09-08 02:54:56,892 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 02:54:56,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:54:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 02:54:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-09-08 02:54:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 02:54:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-08 02:54:56,897 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-08 02:54:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:56,898 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-08 02:54:56,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:54:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-08 02:54:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-08 02:54:56,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:54:56,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:54:56,899 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:54:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:54:56,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-09-08 02:54:56,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:54:56,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:54:56,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:54:56,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:54:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:54:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:54:56,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:54:56,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 02:54:56,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 02:54:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 02:54:56,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:54:56,937 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-08 02:54:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:54:57,069 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-09-08 02:54:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 02:54:57,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-08 02:54:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:54:57,069 INFO L225 Difference]: With dead ends: 125 [2019-09-08 02:54:57,069 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:54:57,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 02:54:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:54:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:54:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:54:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:54:57,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-08 02:54:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:54:57,072 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:54:57,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 02:54:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:54:57,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:54:57,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:54:57,260 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 73 [2019-09-08 02:54:57,415 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-09-08 02:54:57,531 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-09-08 02:54:57,951 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 9 [2019-09-08 02:54:58,147 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-09-08 02:54:58,335 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 18 [2019-09-08 02:54:58,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:54:58,339 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:54:58,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:54:58,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:54:58,340 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:54:58,340 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:54:58,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:54:58,340 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-09-08 02:54:58,340 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-09-08 02:54:58,340 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-09-08 02:54:58,341 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-09-08 02:54:58,341 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-09-08 02:54:58,343 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse2 (<= (+ main_~main__j~0 4) main_~main__bufsize~0))) (let ((.cse0 (and (<= 1 main_~main__j~0) (let ((.cse3 (<= 1 main_~main__i~0))) (or (and .cse3 (not (= main_~__VERIFIER_assert__cond~12 0))) (and .cse3 .cse2))))) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (or (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1) (and (and (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0)) .cse1) (<= 0 main_~main__j~0)) (and .cse0 .cse1 .cse2)))) [2019-09-08 02:54:58,343 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-09-08 02:54:58,343 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-08 02:54:58,343 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-09-08 02:54:58,343 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-09-08 02:54:58,344 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-09-08 02:54:58,344 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-08 02:54:58,344 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-09-08 02:54:58,344 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-09-08 02:54:58,344 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-09-08 02:54:58,345 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-09-08 02:54:58,345 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-09-08 02:54:58,345 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-09-08 02:54:58,345 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-09-08 02:54:58,345 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: true [2019-09-08 02:54:58,346 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-09-08 02:54:58,346 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-09-08 02:54:58,346 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-09-08 02:54:58,346 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-09-08 02:54:58,346 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-09-08 02:54:58,347 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-09-08 02:54:58,347 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-09-08 02:54:58,347 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-09-08 02:54:58,347 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-09-08 02:54:58,347 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-09-08 02:54:58,348 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-09-08 02:54:58,348 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-09-08 02:54:58,348 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-09-08 02:54:58,348 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-09-08 02:54:58,348 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-09-08 02:54:58,349 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-09-08 02:54:58,349 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-09-08 02:54:58,350 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-08 02:54:58,350 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-09-08 02:54:58,350 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-09-08 02:54:58,351 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (<= 0 main_~main__j~0)) [2019-09-08 02:54:58,351 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-09-08 02:54:58,351 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-09-08 02:54:58,351 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-08 02:54:58,351 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-09-08 02:54:58,352 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-09-08 02:54:58,352 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-09-08 02:54:58,352 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-09-08 02:54:58,352 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-09-08 02:54:58,352 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-09-08 02:54:58,353 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-09-08 02:54:58,353 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-09-08 02:54:58,353 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-08 02:54:58,353 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-09-08 02:54:58,353 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-09-08 02:54:58,354 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2019-09-08 02:54:58,354 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-09-08 02:54:58,354 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-09-08 02:54:58,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:54:58 BoogieIcfgContainer [2019-09-08 02:54:58,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:54:58,390 INFO L168 Benchmark]: Toolchain (without parser) took 5286.67 ms. Allocated memory was 133.2 MB in the beginning and 308.3 MB in the end (delta: 175.1 MB). Free memory was 88.9 MB in the beginning and 264.1 MB in the end (delta: -175.2 MB). Peak memory consumption was 129.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:58,392 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 02:54:58,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.26 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 175.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:58,401 INFO L168 Benchmark]: Boogie Preprocessor took 47.37 ms. Allocated memory is still 200.3 MB. Free memory was 175.9 MB in the beginning and 174.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:58,402 INFO L168 Benchmark]: RCFGBuilder took 439.86 ms. Allocated memory is still 200.3 MB. Free memory was 174.1 MB in the beginning and 152.9 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:58,403 INFO L168 Benchmark]: TraceAbstraction took 4322.13 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 152.9 MB in the beginning and 264.1 MB in the end (delta: -111.2 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. [2019-09-08 02:54:58,418 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 133.2 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 473.26 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 175.9 MB in the end (delta: -87.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.37 ms. Allocated memory is still 200.3 MB. Free memory was 175.9 MB in the beginning and 174.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.86 ms. Allocated memory is still 200.3 MB. Free memory was 174.1 MB in the beginning and 152.9 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4322.13 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 152.9 MB in the beginning and 264.1 MB in the end (delta: -111.2 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: 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: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((!(__VERIFIER_assert__cond == 0) && 1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) || (((main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j)) || (((1 <= main__j && ((1 <= main__i && !(__VERIFIER_assert__cond == 0)) || (1 <= main__i && main__j + 4 <= main__bufsize))) && main__limit + 4 <= main__bufsize) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 4.2s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1254 SDslu, 796 SDs, 0 SdLazy, 795 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 118 HoareAnnotationTreeSize, 7 FomulaSimplifications, 84259529 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 304610 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...