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-c6af20d [2019-09-03 19:49:40,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:40,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:40,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:40,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:40,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:40,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:40,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:40,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:40,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:40,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:40,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:40,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:40,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:40,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:40,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:40,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:40,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:41,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:41,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:41,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:41,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:41,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:41,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:41,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:41,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:41,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:41,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:41,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:41,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:41,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:41,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:41,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:41,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:41,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:41,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:41,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:41,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:41,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:41,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:41,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:41,035 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-03 19:49:41,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:41,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:41,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:41,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:41,056 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:41,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:41,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:41,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:41,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:41,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:41,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:41,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:41,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:41,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:41,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:41,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:41,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:41,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:41,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:41,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:41,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:41,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:41,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:41,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:41,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:41,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:41,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:41,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:41,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:41,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:41,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:41,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:41,104 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:41,105 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:41,105 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-03 19:49:41,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0909f4fd/a232fc328b2940a487a8790dd0676b05/FLAGaecd64568 [2019-09-03 19:49:41,626 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:41,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-03 19:49:41,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0909f4fd/a232fc328b2940a487a8790dd0676b05/FLAGaecd64568 [2019-09-03 19:49:42,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0909f4fd/a232fc328b2940a487a8790dd0676b05 [2019-09-03 19:49:42,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:42,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:42,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:42,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:42,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:42,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d21465a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42, skipping insertion in model container [2019-09-03 19:49:42,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:42,120 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:42,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:42,334 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:42,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:42,466 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:42,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42 WrapperNode [2019-09-03 19:49:42,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:42,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:42,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:42,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:42,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (1/1) ... [2019-09-03 19:49:42,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:42,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:42,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:42,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:42,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (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-03 19:49:42,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:42,564 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:42,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:42,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:42,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:42,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:42,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:42,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:42,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:42,953 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:42,954 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:49:42,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:42 BoogieIcfgContainer [2019-09-03 19:49:42,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:42,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:42,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:42,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:42,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:42" (1/3) ... [2019-09-03 19:49:42,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:42, skipping insertion in model container [2019-09-03 19:49:42,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:42" (2/3) ... [2019-09-03 19:49:42,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b729f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:42, skipping insertion in model container [2019-09-03 19:49:42,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:42" (3/3) ... [2019-09-03 19:49:42,963 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-03 19:49:42,972 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:42,980 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-03 19:49:42,993 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-03 19:49:43,023 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:43,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:43,024 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:43,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:43,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:43,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:43,025 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:43,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:43,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-03 19:49:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:43,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:43,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:43,054 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-03 19:49:43,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:43,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:43,232 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-03 19:49:43,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:43,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:43,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:43,252 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-03 19:49:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:43,455 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2019-09-03 19:49:43,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:43,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:43,468 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:49:43,468 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:49:43,472 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-03 19:49:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:49:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-03 19:49:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:49:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-03 19:49:43,518 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-03 19:49:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:43,518 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-03 19:49:43,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-03 19:49:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:43,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:43,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:43,520 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:43,521 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-03 19:49:43,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:43,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:43,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:43,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:43,591 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-03 19:49:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:43,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:43,597 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-03 19:49:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:43,690 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-03 19:49:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:43,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:43,692 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:49:43,692 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:49:43,693 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-03 19:49:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:49:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-03 19:49:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:49:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-03 19:49:43,702 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-03 19:49:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:43,703 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-03 19:49:43,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-03 19:49:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:49:43,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:43,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:43,705 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-03 19:49:43,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:43,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:43,754 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-03 19:49:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:43,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:43,756 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-03 19:49:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:43,832 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-03 19:49:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:43,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-03 19:49:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:43,834 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:49:43,834 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 19:49:43,835 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-03 19:49:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 19:49:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-03 19:49:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-03 19:49:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-03 19:49:43,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-03 19:49:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:43,846 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-03 19:49:43,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-03 19:49:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:43,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:43,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:43,848 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-03 19:49:43,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:43,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:43,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:43,913 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-03 19:49:43,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:43,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:43,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:43,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:43,915 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-03 19:49:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,041 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-03 19:49:44,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:44,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,043 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:49:44,043 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 19:49:44,044 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-03 19:49:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 19:49:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-03 19:49:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-03 19:49:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-03 19:49:44,058 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-03 19:49:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,059 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-03 19:49:44,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-03 19:49:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:44,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,063 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-03 19:49:44,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,139 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-03 19:49:44,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:44,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:44,141 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-03 19:49:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,240 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-03 19:49:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:44,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,241 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:49:44,241 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:49:44,242 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-03 19:49:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:49:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-03 19:49:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-03 19:49:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-03 19:49:44,253 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-03 19:49:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,253 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-03 19:49:44,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-03 19:49:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:44,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,255 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,255 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-03 19:49:44,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,307 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-03 19:49:44,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:44,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:44,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:44,308 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-03 19:49:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,428 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-09-03 19:49:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:44,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 19:49:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,429 INFO L225 Difference]: With dead ends: 112 [2019-09-03 19:49:44,430 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 19:49:44,430 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-03 19:49:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 19:49:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-03 19:49:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-03 19:49:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-03 19:49:44,447 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-03 19:49:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,448 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-03 19:49:44,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-03 19:49:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:44,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,451 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,452 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-03 19:49:44,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,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-03 19:49:44,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:44,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:44,517 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-03 19:49:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,575 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-03 19:49:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:44,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,578 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:49:44,579 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 19:49:44,582 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-03 19:49:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 19:49:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-03 19:49:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-03 19:49:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-03 19:49:44,592 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-03 19:49:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,593 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-03 19:49:44,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-03 19:49:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:44,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-03 19:49:44,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,651 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-03 19:49:44,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:44,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:44,653 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-03 19:49:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,714 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-03 19:49:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:44,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,715 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:49:44,716 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:49:44,716 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-03 19:49:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:49:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-03 19:49:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:49:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-03 19:49:44,721 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-03 19:49:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,722 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-03 19:49:44,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-03 19:49:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:44,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,724 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-03 19:49:44,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,772 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-03 19:49:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:44,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:44,774 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-03 19:49:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:44,886 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-03 19:49:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:44,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:44,888 INFO L225 Difference]: With dead ends: 95 [2019-09-03 19:49:44,888 INFO L226 Difference]: Without dead ends: 93 [2019-09-03 19:49:44,888 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-03 19:49:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-03 19:49:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-03 19:49:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:49:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-03 19:49:44,901 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-03 19:49:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:44,901 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-03 19:49:44,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-03 19:49:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:44,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:44,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:44,903 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-03 19:49:44,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:44,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:44,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:44,962 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-03 19:49:44,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:44,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:44,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:44,964 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-03 19:49:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,044 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-09-03 19:49:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:45,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,047 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:49:45,047 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:49:45,047 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-03 19:49:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:49:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-03 19:49:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:49:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-03 19:49:45,054 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-03 19:49:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,057 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-03 19:49:45,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-03 19:49:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:45,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,058 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:45,059 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-03 19:49:45,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,118 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-03 19:49:45,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,119 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-03 19:49:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,198 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-03 19:49:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:45,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,200 INFO L225 Difference]: With dead ends: 53 [2019-09-03 19:49:45,200 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 19:49:45,200 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-03 19:49:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 19:49:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 19:49:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 19:49:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-03 19:49:45,205 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-03 19:49:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,205 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-03 19:49:45,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-03 19:49:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:45,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,207 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-03 19:49:45,207 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-03 19:49:45,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,273 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-03 19:49:45,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,276 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-03 19:49:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,340 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-03 19:49:45,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:45,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,341 INFO L225 Difference]: With dead ends: 50 [2019-09-03 19:49:45,341 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:49:45,342 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-03 19:49:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:49:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-03 19:49:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:49:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 19:49:45,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-03 19:49:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,348 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 19:49:45,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,348 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 19:49:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:45,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,349 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-03 19:49:45,350 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-03 19:49:45,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,383 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-03 19:49:45,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,384 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-03 19:49:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,472 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-09-03 19:49:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:45,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,473 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:49:45,473 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:49:45,474 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-03 19:49:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:49:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-03 19:49:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:49:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 19:49:45,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-03 19:49:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,479 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 19:49:45,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 19:49:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:45,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,482 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-03 19:49:45,482 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-03 19:49:45,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,548 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-03 19:49:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,550 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-03 19:49:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,625 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-03 19:49:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:45,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,627 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:49:45,628 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 19:49:45,628 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-03 19:49:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 19:49:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-03 19:49:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-03 19:49:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-03 19:49:45,631 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-03 19:49:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,631 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-03 19:49:45,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-03 19:49:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:45,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,632 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-03 19:49:45,633 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-03 19:49:45,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,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-03 19:49:45,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,674 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-03 19:49:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,732 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 19:49:45,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:45,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,733 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:49:45,733 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 19:49:45,734 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-03 19:49:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 19:49:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 19:49:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:49:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:49:45,737 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-03 19:49:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,737 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:49:45,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:49:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:49:45,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,738 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-03 19:49:45,739 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-03 19:49:45,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,792 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-03 19:49:45,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:45,794 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-03 19:49:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,859 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-03 19:49:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:45,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 19:49:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,860 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:49:45,860 INFO L226 Difference]: Without dead ends: 50 [2019-09-03 19:49:45,860 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-03 19:49:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-03 19:49:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-03 19:49:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:49:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 19:49:45,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-03 19:49:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,865 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 19:49:45,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 19:49:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:49:45,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,866 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-03 19:49:45,866 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-03 19:49:45,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,891 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-03 19:49:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:45,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:45,893 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-03 19:49:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,915 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-03 19:49:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:45,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 19:49:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,917 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:49:45,917 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:49:45,917 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-03 19:49:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:49:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:49:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:49:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-03 19:49:45,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-03 19:49:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,920 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-03 19:49:45,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-03 19:49:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:49:45,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:45,921 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-03 19:49:45,922 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:45,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-03 19:49:45,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:45,943 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-03 19:49:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:45,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:45,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:45,944 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-03 19:49:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:45,991 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-03 19:49:45,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:45,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 19:49:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:45,992 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:49:45,992 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:45,992 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-03 19:49:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:45,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-03 19:49:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:45,993 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:45,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:45,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:45,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:46,317 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:46,317 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:46,317 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:46,317 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:46,317 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:49:46,318 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-09-03 19:49:46,318 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-09-03 19:49:46,319 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-09-03 19:49:46,319 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-09-03 19:49:46,319 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-09-03 19:49:46,319 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-09-03 19:49:46,320 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-09-03 19:49:46,320 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-09-03 19:49:46,321 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-09-03 19:49:46,321 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-09-03 19:49:46,321 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-09-03 19:49:46,321 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-09-03 19:49:46,321 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-09-03 19:49:46,321 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-03 19:49:46,321 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-09-03 19:49:46,322 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-09-03 19:49:46,322 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-09-03 19:49:46,322 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-09-03 19:49:46,323 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-03 19:49:46,323 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-09-03 19:49:46,323 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-09-03 19:49:46,324 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-03 19:49:46,324 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-09-03 19:49:46,325 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-09-03 19:49:46,326 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-09-03 19:49:46,327 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-09-03 19:49:46,328 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-09-03 19:49:46,328 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-03 19:49:46,328 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-03 19:49:46,328 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-09-03 19:49:46,328 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-09-03 19:49:46,328 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-03 19:49:46,329 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-09-03 19:49:46,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:49:46 BoogieIcfgContainer [2019-09-03 19:49:46,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:49:46,363 INFO L168 Benchmark]: Toolchain (without parser) took 4295.97 ms. Allocated memory was 133.2 MB in the beginning and 262.7 MB in the end (delta: 129.5 MB). Free memory was 89.2 MB in the beginning and 226.4 MB in the end (delta: -137.2 MB). Peak memory consumption was 133.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,365 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.21 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 89.0 MB in the beginning and 176.7 MB in the end (delta: -87.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,373 INFO L168 Benchmark]: Boogie Preprocessor took 38.75 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 174.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,374 INFO L168 Benchmark]: RCFGBuilder took 449.06 ms. Allocated memory is still 200.3 MB. Free memory was 174.8 MB in the beginning and 151.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,375 INFO L168 Benchmark]: TraceAbstraction took 3400.70 ms. Allocated memory was 200.3 MB in the beginning and 262.7 MB in the end (delta: 62.4 MB). Free memory was 151.0 MB in the beginning and 226.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:46,388 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.21 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 89.0 MB in the beginning and 176.7 MB in the end (delta: -87.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.75 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 174.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.06 ms. Allocated memory is still 200.3 MB. Free memory was 174.8 MB in the beginning and 151.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3400.70 ms. Allocated memory was 200.3 MB in the beginning and 262.7 MB in the end (delta: 62.4 MB). Free memory was 151.0 MB in the beginning and 226.4 MB in the end (delta: -75.4 MB). Peak memory consumption was 128.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 334]: 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: 346]: 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: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: 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: 184]: 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: 305]: 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: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: 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.3s 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.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1388 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 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...