java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:59:05,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:59:05,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:59:05,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:59:05,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:59:05,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:59:05,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:59:05,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:59:05,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:59:05,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:59:05,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:59:05,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:59:05,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:59:05,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:59:05,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:59:05,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:59:05,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:59:05,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:59:05,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:59:05,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:59:05,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:59:05,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:59:05,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:59:05,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:59:05,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:59:05,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:59:05,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:59:05,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:59:05,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:59:05,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:59:05,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:59:05,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:59:05,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:59:05,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:59:05,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:59:05,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:59:05,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:59:05,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:59:05,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:59:05,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:59:05,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:59:05,985 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-05 11:59:06,000 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:59:06,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:59:06,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:59:06,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:59:06,002 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:59:06,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:59:06,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:59:06,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:59:06,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:59:06,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:59:06,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:59:06,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:59:06,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:59:06,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:59:06,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:59:06,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:59:06,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:59:06,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:59:06,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:59:06,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:59:06,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:59:06,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:59:06,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:59:06,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:59:06,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:59:06,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:59:06,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:59:06,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:59:06,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:59:06,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:59:06,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:59:06,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:59:06,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:59:06,053 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:59:06,054 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-05 11:59:06,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25bc338d/72fd947a3a044f14a3b4083e8811b7e4/FLAGdbd7745e0 [2019-09-05 11:59:06,574 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:59:06,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-05 11:59:06,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25bc338d/72fd947a3a044f14a3b4083e8811b7e4/FLAGdbd7745e0 [2019-09-05 11:59:06,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25bc338d/72fd947a3a044f14a3b4083e8811b7e4 [2019-09-05 11:59:06,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:59:06,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:59:06,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:06,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:59:06,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:59:06,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:06" (1/1) ... [2019-09-05 11:59:06,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca4fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:06, skipping insertion in model container [2019-09-05 11:59:06,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:59:06" (1/1) ... [2019-09-05 11:59:06,984 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:59:07,022 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:59:07,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:07,265 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:59:07,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:59:07,406 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:59:07,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07 WrapperNode [2019-09-05 11:59:07,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:59:07,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:59:07,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:59:07,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:59:07,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (1/1) ... [2019-09-05 11:59:07,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:59:07,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:59:07,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:59:07,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:59:07,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (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-05 11:59:07,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:59:07,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:59:07,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:59:07,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:59:07,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:59:07,955 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:59:07,956 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 11:59:07,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:07 BoogieIcfgContainer [2019-09-05 11:59:07,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:59:07,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:59:07,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:59:07,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:59:07,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:59:06" (1/3) ... [2019-09-05 11:59:07,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591a9620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:07, skipping insertion in model container [2019-09-05 11:59:07,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:59:07" (2/3) ... [2019-09-05 11:59:07,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591a9620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:59:07, skipping insertion in model container [2019-09-05 11:59:07,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:59:07" (3/3) ... [2019-09-05 11:59:07,966 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-05 11:59:07,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:59:07,985 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-05 11:59:08,003 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-05 11:59:08,032 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:59:08,033 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:59:08,033 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:59:08,033 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:59:08,034 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:59:08,034 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:59:08,034 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:59:08,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:59:08,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:59:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-05 11:59:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:59:08,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:08,061 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:08,063 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-05 11:59:08,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:08,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:08,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:08,244 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-05 11:59:08,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:08,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:08,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:08,270 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-05 11:59:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:08,499 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2019-09-05 11:59:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:08,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 11:59:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:08,518 INFO L225 Difference]: With dead ends: 133 [2019-09-05 11:59:08,518 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 11:59:08,523 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-05 11:59:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 11:59:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-05 11:59:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 11:59:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-05 11:59:08,589 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-05 11:59:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:08,589 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-05 11:59:08,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-05 11:59:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:59:08,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:08,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:08,592 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:08,592 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-05 11:59:08,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:08,689 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-05 11:59:08,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:08,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:08,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:08,693 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-05 11:59:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:08,784 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-05 11:59:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:08,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 11:59:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:08,786 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:59:08,787 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:59:08,787 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-05 11:59:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:59:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 11:59:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:59:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-05 11:59:08,796 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-05 11:59:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:08,797 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-05 11:59:08,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-05 11:59:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:59:08,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:08,798 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:08,799 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-05 11:59:08,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:08,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:08,841 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-05 11:59:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:08,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:08,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:08,843 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-05 11:59:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:08,942 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-05 11:59:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:08,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-05 11:59:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:08,946 INFO L225 Difference]: With dead ends: 73 [2019-09-05 11:59:08,947 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 11:59:08,947 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-05 11:59:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 11:59:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-05 11:59:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:59:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-05 11:59:08,956 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-05 11:59:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:08,957 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-05 11:59:08,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-05 11:59:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:59:08,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:08,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:08,960 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-05 11:59:08,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:08,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,057 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-05 11:59:09,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:09,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:09,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:09,060 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-05 11:59:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,166 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-05 11:59:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:09,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 11:59:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,169 INFO L225 Difference]: With dead ends: 71 [2019-09-05 11:59:09,169 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 11:59:09,170 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-05 11:59:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 11:59:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-05 11:59:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 11:59:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-05 11:59:09,185 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-05 11:59:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,186 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-05 11:59:09,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-05 11:59:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:59:09,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,189 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-05 11:59:09,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,252 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-05 11:59:09,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:09,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:09,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:09,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:09,255 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-05 11:59:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,349 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-05 11:59:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:09,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 11:59:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,351 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:59:09,351 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:59:09,351 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-05 11:59:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:59:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-05 11:59:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 11:59:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-05 11:59:09,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-05 11:59:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,358 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-05 11:59:09,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-05 11:59:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:09,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,360 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-05 11:59:09,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,427 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-05 11:59:09,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:09,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:09,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:09,429 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-05 11:59:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,542 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-09-05 11:59:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:09,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 11:59:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,544 INFO L225 Difference]: With dead ends: 112 [2019-09-05 11:59:09,544 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 11:59:09,545 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-05 11:59:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 11:59:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-05 11:59:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 11:59:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-05 11:59:09,552 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-05 11:59:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,552 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-05 11:59:09,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-05 11:59:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:09,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,554 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-05 11:59:09,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,592 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-05 11:59:09,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:09,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:09,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:09,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:09,595 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-05 11:59:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,655 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-05 11:59:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:09,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 11:59:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,656 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:59:09,656 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 11:59:09,657 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-05 11:59:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 11:59:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 11:59:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 11:59:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-05 11:59:09,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-05 11:59:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,663 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-05 11:59:09,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-05 11:59:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:59:09,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,665 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-05 11:59:09,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,697 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-05 11:59:09,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:09,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:09,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:09,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:09,699 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-05 11:59:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,755 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-05 11:59:09,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:09,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 11:59:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,756 INFO L225 Difference]: With dead ends: 61 [2019-09-05 11:59:09,756 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 11:59:09,756 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-05 11:59:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 11:59:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-05 11:59:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 11:59:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-05 11:59:09,762 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-05 11:59:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,762 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-05 11:59:09,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-05 11:59:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:09,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,764 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,764 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-05 11:59:09,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:09,858 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-05 11:59:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:09,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:09,859 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-05 11:59:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:09,972 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-05 11:59:09,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:09,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:09,974 INFO L225 Difference]: With dead ends: 95 [2019-09-05 11:59:09,974 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 11:59:09,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 11:59:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-05 11:59:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 11:59:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-05 11:59:09,986 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-05 11:59:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:09,987 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-05 11:59:09,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-05 11:59:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:09,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:09,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:09,992 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-05 11:59:09,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:09,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,051 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-05 11:59:10,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,053 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-05 11:59:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,131 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-09-05 11:59:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:10,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,133 INFO L225 Difference]: With dead ends: 72 [2019-09-05 11:59:10,133 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 11:59:10,135 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-05 11:59:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 11:59:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-05 11:59:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 11:59:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-05 11:59:10,143 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-05 11:59:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,143 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-05 11:59:10,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-05 11:59:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 11:59:10,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:59:10,149 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-05 11:59:10,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,192 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-05 11:59:10,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,194 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-05 11:59:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,263 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-05 11:59:10,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:10,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 11:59:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,265 INFO L225 Difference]: With dead ends: 53 [2019-09-05 11:59:10,265 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:59:10,266 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-05 11:59:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:59:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 11:59:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 11:59:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-05 11:59:10,279 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-05 11:59:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,279 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-05 11:59:10,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-05 11:59:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:10,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,283 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-05 11:59:10,284 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-05 11:59:10,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,358 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-05 11:59:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,360 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-05 11:59:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,453 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-05 11:59:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:10,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,455 INFO L225 Difference]: With dead ends: 50 [2019-09-05 11:59:10,455 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 11:59:10,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 11:59:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-05 11:59:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 11:59:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-05 11:59:10,461 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-05 11:59:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,462 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-05 11:59:10,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-05 11:59:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:10,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,464 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-05 11:59:10,465 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-05 11:59:10,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:59:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,515 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-05 11:59:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,608 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-09-05 11:59:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:10,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,609 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:59:10,609 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:59:10,610 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-05 11:59:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:59:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-05 11:59:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:59:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 11:59:10,613 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-05 11:59:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,614 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 11:59:10,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 11:59:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:10,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,615 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-05 11:59:10,615 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-05 11:59:10,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,673 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-05 11:59:10,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,675 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-05 11:59:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,761 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-05 11:59:10,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:10,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,763 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:59:10,763 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 11:59:10,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 11:59:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-05 11:59:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:59:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 11:59:10,767 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-05 11:59:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,767 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 11:59:10,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 11:59:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:59:10,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,768 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-05 11:59:10,769 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-05 11:59:10,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,823 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-05 11:59:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,825 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-05 11:59:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,881 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-05 11:59:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:59:10,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 11:59:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,882 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:59:10,882 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:59:10,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:59:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:59:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 11:59:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:59:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 11:59:10,886 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-05 11:59:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 11:59:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 11:59:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 11:59:10,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,887 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-05 11:59:10,888 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-05 11:59:10,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:10,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:10,925 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-05 11:59:10,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:10,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:59:10,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:59:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:59:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:59:10,927 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-05 11:59:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:10,992 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-05 11:59:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:59:10,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 11:59:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:10,994 INFO L225 Difference]: With dead ends: 52 [2019-09-05 11:59:10,994 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 11:59:10,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:59:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 11:59:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-05 11:59:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:59:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 11:59:10,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-05 11:59:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:10,998 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 11:59:10,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:59:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 11:59:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:59:10,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:10,999 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-05 11:59:11,000 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-05 11:59:11,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:11,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:11,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:11,025 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-05 11:59:11,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:11,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:11,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:11,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:11,026 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-05 11:59:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:11,053 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-05 11:59:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:11,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 11:59:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:11,054 INFO L225 Difference]: With dead ends: 35 [2019-09-05 11:59:11,054 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:59:11,054 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-05 11:59:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:59:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:59:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:59:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 11:59:11,057 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-05 11:59:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:11,058 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 11:59:11,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 11:59:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:59:11,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:59:11,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, 1] [2019-09-05 11:59:11,059 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:59:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:59:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-05 11:59:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:59:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:59:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:59:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:59:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:59:11,082 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-05 11:59:11,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:59:11,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:59:11,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:59:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:59:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:59:11,084 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-05 11:59:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:59:11,127 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-05 11:59:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:59:11,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-05 11:59:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:59:11,128 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:59:11,128 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:59:11,129 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-05 11:59:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:59:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:59:11,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:59:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:59:11,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-05 11:59:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:59:11,130 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:59:11,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:59:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:59:11,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:59:11,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:59:11,478 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:59:11,479 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:59:11,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:11,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:59:11,479 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:59:11,479 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:59:11,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:59:11,479 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-09-05 11:59:11,480 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-05 11:59:11,480 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-09-05 11:59:11,480 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-05 11:59:11,480 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-09-05 11:59:11,480 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-09-05 11:59:11,481 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-09-05 11:59:11,482 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-09-05 11:59:11,483 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-09-05 11:59:11,484 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-09-05 11:59:11,484 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-09-05 11:59:11,484 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-09-05 11:59:11,484 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-09-05 11:59:11,485 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-09-05 11:59:11,485 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-09-05 11:59:11,485 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-09-05 11:59:11,485 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-09-05 11:59:11,485 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-09-05 11:59:11,485 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-09-05 11:59:11,486 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-09-05 11:59:11,487 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-09-05 11:59:11,488 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-09-05 11:59:11,489 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-09-05 11:59:11,489 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-09-05 11:59:11,489 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-09-05 11:59:11,489 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-09-05 11:59:11,490 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-09-05 11:59:11,491 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-09-05 11:59:11,491 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-09-05 11:59:11,491 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-09-05 11:59:11,491 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-05 11:59:11,491 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-09-05 11:59:11,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:59:11 BoogieIcfgContainer [2019-09-05 11:59:11,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:59:11,512 INFO L168 Benchmark]: Toolchain (without parser) took 4543.12 ms. Allocated memory was 136.8 MB in the beginning and 272.6 MB in the end (delta: 135.8 MB). Free memory was 84.0 MB in the beginning and 89.9 MB in the end (delta: -5.9 MB). Peak memory consumption was 129.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,513 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 102.8 MB in the beginning and 102.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.73 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 83.8 MB in the beginning and 173.6 MB in the end (delta: -89.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,515 INFO L168 Benchmark]: Boogie Preprocessor took 41.10 ms. Allocated memory is still 197.1 MB. Free memory was 173.6 MB in the beginning and 171.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,516 INFO L168 Benchmark]: RCFGBuilder took 508.47 ms. Allocated memory is still 197.1 MB. Free memory was 171.7 MB in the beginning and 148.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,517 INFO L168 Benchmark]: TraceAbstraction took 3550.77 ms. Allocated memory was 197.1 MB in the beginning and 272.6 MB in the end (delta: 75.5 MB). Free memory was 148.2 MB in the beginning and 89.9 MB in the end (delta: 58.3 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. [2019-09-05 11:59:11,521 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.22 ms. Allocated memory is still 136.8 MB. Free memory was 102.8 MB in the beginning and 102.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.73 ms. Allocated memory was 136.8 MB in the beginning and 197.1 MB in the end (delta: 60.3 MB). Free memory was 83.8 MB in the beginning and 173.6 MB in the end (delta: -89.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.10 ms. Allocated memory is still 197.1 MB. Free memory was 173.6 MB in the beginning and 171.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 508.47 ms. Allocated memory is still 197.1 MB. Free memory was 171.7 MB in the beginning and 148.2 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3550.77 ms. Allocated memory was 197.1 MB in the beginning and 272.6 MB in the end (delta: 75.5 MB). Free memory was 148.2 MB in the beginning and 89.9 MB in the end (delta: 58.3 MB). Peak memory consumption was 133.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: 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: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 3.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 804 SDtfs, 1254 SDslu, 811 SDs, 0 SdLazy, 927 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 63 HoareAnnotationTreeSize, 9 FomulaSimplifications, 49055 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1388 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 9626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...