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.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:23,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:23,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:23,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:23,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:23,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:23,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:23,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:23,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:23,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:23,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:23,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:23,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:23,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:23,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:23,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:23,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:23,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:23,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:23,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:23,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:23,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:23,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:23,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:23,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:23,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:23,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:23,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:23,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:23,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:23,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:23,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:23,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:23,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:23,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:23,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:23,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:23,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:23,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:23,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:23,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:23,274 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:23,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:23,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:23,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:23,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:23,297 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:23,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:23,297 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:23,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:23,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:23,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:23,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:23,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:23,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:23,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:23,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:23,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:23,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:23,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:23,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:23,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:23,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:23,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:23,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:23,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:23,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:23,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:23,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:23,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:23,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:23,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:23,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:23,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:23,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:23,380 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:23,382 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.p+lhb-reducer.c [2019-09-03 19:49:23,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e6a9e82/00cd85d02269443193428200bb54c0d1/FLAG04c420437 [2019-09-03 19:49:23,907 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:23,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-09-03 19:49:23,920 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e6a9e82/00cd85d02269443193428200bb54c0d1/FLAG04c420437 [2019-09-03 19:49:24,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e6a9e82/00cd85d02269443193428200bb54c0d1 [2019-09-03 19:49:24,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:24,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:24,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:24,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:24,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:24,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:24" (1/1) ... [2019-09-03 19:49:24,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f59eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:24, skipping insertion in model container [2019-09-03 19:49:24,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:24" (1/1) ... [2019-09-03 19:49:24,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:24,383 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:24,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:24,665 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:24,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:24,885 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:24,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:24 WrapperNode [2019-09-03 19:49:24,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:24,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:24,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:24,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:24,901 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:24" (1/1) ... [2019-09-03 19:49:24,901 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:24" (1/1) ... [2019-09-03 19:49:24,912 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:24" (1/1) ... [2019-09-03 19:49:24,912 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:24" (1/1) ... [2019-09-03 19:49:24,927 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:24" (1/1) ... [2019-09-03 19:49:24,936 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:24" (1/1) ... [2019-09-03 19:49:24,939 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:24" (1/1) ... [2019-09-03 19:49:24,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:24,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:24,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:24,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:24,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:24" (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:24,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:24,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:24,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:24,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:25,722 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:25,722 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:49:25,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:25 BoogieIcfgContainer [2019-09-03 19:49:25,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:25,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:25,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:25,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:25,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:24" (1/3) ... [2019-09-03 19:49:25,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1a23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:25, skipping insertion in model container [2019-09-03 19:49:25,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:24" (2/3) ... [2019-09-03 19:49:25,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f1a23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:25, skipping insertion in model container [2019-09-03 19:49:25,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:25" (3/3) ... [2019-09-03 19:49:25,733 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-09-03 19:49:25,743 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:25,751 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 19:49:25,768 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 19:49:25,801 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:25,802 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:25,802 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:25,802 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:25,803 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:25,803 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:25,803 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:25,803 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:25,804 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-09-03 19:49:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:49:25,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:25,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:25,837 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-09-03 19:49:25,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:26,008 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:26,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:26,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:26,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:26,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:26,034 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-09-03 19:49:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:26,402 INFO L93 Difference]: Finished difference Result 135 states and 211 transitions. [2019-09-03 19:49:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:26,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 19:49:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:26,419 INFO L225 Difference]: With dead ends: 135 [2019-09-03 19:49:26,419 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:49:26,423 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:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:49:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-03 19:49:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-03 19:49:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-09-03 19:49:26,523 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-09-03 19:49:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:26,524 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-09-03 19:49:26,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-09-03 19:49:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:26,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:26,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:26,530 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:26,532 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-09-03 19:49:26,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:26,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:26,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:26,630 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:26,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:26,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:26,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:26,635 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 4 states. [2019-09-03 19:49:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:26,844 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2019-09-03 19:49:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:26,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:26,846 INFO L225 Difference]: With dead ends: 118 [2019-09-03 19:49:26,846 INFO L226 Difference]: Without dead ends: 113 [2019-09-03 19:49:26,847 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:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-03 19:49:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-09-03 19:49:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-09-03 19:49:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-09-03 19:49:26,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-09-03 19:49:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:26,861 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-09-03 19:49:26,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-09-03 19:49:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:26,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:26,862 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:26,863 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-09-03 19:49:26,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:26,933 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:26,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:26,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:26,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:26,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:26,938 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 5 states. [2019-09-03 19:49:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:27,167 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-03 19:49:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:27,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:27,169 INFO L225 Difference]: With dead ends: 113 [2019-09-03 19:49:27,169 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:49:27,169 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:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:49:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-03 19:49:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-03 19:49:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-09-03 19:49:27,178 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-09-03 19:49:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:27,178 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-09-03 19:49:27,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-09-03 19:49:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:27,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:27,180 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:27,180 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:27,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:27,181 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-09-03 19:49:27,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:27,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:27,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:27,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:27,229 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:27,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:27,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:27,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:27,231 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 4 states. [2019-09-03 19:49:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:27,387 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-09-03 19:49:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:27,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:27,390 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:49:27,391 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 19:49:27,392 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:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 19:49:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-03 19:49:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-03 19:49:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-09-03 19:49:27,399 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-09-03 19:49:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:27,400 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-09-03 19:49:27,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-09-03 19:49:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:27,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:27,401 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:27,401 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-09-03 19:49:27,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:27,446 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:27,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:27,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:27,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:27,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:27,448 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 5 states. [2019-09-03 19:49:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:27,663 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-09-03 19:49:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:27,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:27,665 INFO L225 Difference]: With dead ends: 125 [2019-09-03 19:49:27,665 INFO L226 Difference]: Without dead ends: 123 [2019-09-03 19:49:27,666 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:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-03 19:49:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-09-03 19:49:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 19:49:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-09-03 19:49:27,675 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-09-03 19:49:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:27,675 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-09-03 19:49:27,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-09-03 19:49:27,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:27,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:27,677 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:27,677 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-09-03 19:49:27,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:27,731 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:27,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:27,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:27,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:27,732 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 5 states. [2019-09-03 19:49:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:27,893 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-09-03 19:49:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:27,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:27,894 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:49:27,894 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 19:49:27,895 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:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 19:49:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-09-03 19:49:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:49:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-09-03 19:49:27,901 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-09-03 19:49:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:27,902 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-09-03 19:49:27,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-09-03 19:49:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:27,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:27,903 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:27,904 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-09-03 19:49:27,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:27,972 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:27,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:27,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:27,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:27,974 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-09-03 19:49:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:28,188 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-03 19:49:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:28,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:28,195 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:49:28,195 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:49:28,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:49:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-09-03 19:49:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 19:49:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-09-03 19:49:28,201 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-09-03 19:49:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:28,202 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-09-03 19:49:28,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-09-03 19:49:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:28,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:28,203 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:28,204 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-09-03 19:49:28,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:28,254 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:28,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:28,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:28,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:28,255 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 5 states. [2019-09-03 19:49:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:28,452 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-09-03 19:49:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:28,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:28,454 INFO L225 Difference]: With dead ends: 120 [2019-09-03 19:49:28,454 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:49:28,454 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:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:49:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-09-03 19:49:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-03 19:49:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-09-03 19:49:28,461 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-09-03 19:49:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:28,461 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-09-03 19:49:28,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-09-03 19:49:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:28,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:28,462 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:28,463 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-09-03 19:49:28,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:28,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:28,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:28,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:28,539 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:28,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:28,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:28,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:28,540 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-09-03 19:49:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:28,736 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-09-03 19:49:28,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:28,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:28,738 INFO L225 Difference]: With dead ends: 99 [2019-09-03 19:49:28,738 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:49:28,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:49:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 19:49:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:49:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-09-03 19:49:28,745 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-09-03 19:49:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:28,746 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-09-03 19:49:28,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-09-03 19:49:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:49:28,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:28,747 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:28,748 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-09-03 19:49:28,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:28,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:28,850 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:28,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:28,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:28,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:28,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:28,852 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-09-03 19:49:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,066 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-09-03 19:49:29,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:29,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 19:49:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,067 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:49:29,067 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 19:49:29,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 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:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 19:49:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-09-03 19:49:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-03 19:49:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-09-03 19:49:29,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-09-03 19:49:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,072 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-09-03 19:49:29,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-09-03 19:49:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:49:29,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,074 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:29,074 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-09-03 19:49:29,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:29,103 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:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:29,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:29,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:29,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:29,105 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 4 states. [2019-09-03 19:49:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,171 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2019-09-03 19:49:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:29,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 19:49:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,173 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:49:29,173 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:49:29,173 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:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:49:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-03 19:49:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:49:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-09-03 19:49:29,178 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-09-03 19:49:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,178 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-09-03 19:49:29,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-09-03 19:49:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:49:29,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,179 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,180 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-09-03 19:49:29,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:29,215 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:29,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:29,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:29,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:29,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:29,216 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 4 states. [2019-09-03 19:49:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,331 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-03 19:49:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:29,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 19:49:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,332 INFO L225 Difference]: With dead ends: 91 [2019-09-03 19:49:29,333 INFO L226 Difference]: Without dead ends: 58 [2019-09-03 19:49:29,334 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:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-03 19:49:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-03 19:49:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-03 19:49:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-09-03 19:49:29,337 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-09-03 19:49:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,337 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-09-03 19:49:29,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-09-03 19:49:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:49:29,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-09-03 19:49:29,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:29,493 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:29,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:29,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-03 19:49:29,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:49:29,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:49:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:29,495 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 13 states. [2019-09-03 19:49:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,609 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-09-03 19:49:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:49:29,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-03 19:49:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,610 INFO L225 Difference]: With dead ends: 67 [2019-09-03 19:49:29,610 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 19:49:29,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 19:49:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-09-03 19:49:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-03 19:49:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-09-03 19:49:29,614 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-09-03 19:49:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,614 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-09-03 19:49:29,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:49:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-09-03 19:49:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:49:29,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,617 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-09-03 19:49:29,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:29,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:29,755 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:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:29,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-03 19:49:29,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 19:49:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 19:49:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:49:29,757 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 13 states. [2019-09-03 19:49:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:29,888 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-09-03 19:49:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 19:49:29,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-09-03 19:49:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:29,890 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:49:29,890 INFO L226 Difference]: Without dead ends: 54 [2019-09-03 19:49:29,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:49:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-03 19:49:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-09-03 19:49:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-03 19:49:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-09-03 19:49:29,893 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-09-03 19:49:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:29,894 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-09-03 19:49:29,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 19:49:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-09-03 19:49:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:49:29,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:29,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:29,896 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-09-03 19:49:29,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:29,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:29,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:29,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:30,080 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:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:30,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:30,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:30,082 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 5 states. [2019-09-03 19:49:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:30,183 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-09-03 19:49:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:30,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-03 19:49:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:30,184 INFO L225 Difference]: With dead ends: 62 [2019-09-03 19:49:30,184 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 19:49:30,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 19:49:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-09-03 19:49:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-03 19:49:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-09-03 19:49:30,189 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-09-03 19:49:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:30,190 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-09-03 19:49:30,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-09-03 19:49:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-03 19:49:30,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:30,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:30,191 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-09-03 19:49:30,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:30,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:30,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:30,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:30,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:30,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:30,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:30,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:30,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:30,378 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 5 states. [2019-09-03 19:49:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:30,475 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-09-03 19:49:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:30,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-03 19:49:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:30,475 INFO L225 Difference]: With dead ends: 52 [2019-09-03 19:49:30,476 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:30,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 24 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:30,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-09-03 19:49:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:30,478 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:30,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:30,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:30,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:30,593 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:30,594 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:30,594 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:30,594 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:30,594 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:49:30,594 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:30,594 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-09-03 19:49:30,595 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-09-03 19:49:30,596 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-09-03 19:49:30,597 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-09-03 19:49:30,598 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-09-03 19:49:30,599 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-09-03 19:49:30,600 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-09-03 19:49:30,601 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-03 19:49:30,602 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-09-03 19:49:30,602 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-09-03 19:49:30,602 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-09-03 19:49:30,602 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-09-03 19:49:30,602 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-09-03 19:49:30,602 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-09-03 19:49:30,603 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-09-03 19:49:30,604 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 1 main_~main__t~0)) [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-03 19:49:30,605 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-09-03 19:49:30,606 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-09-03 19:49:30,607 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-09-03 19:49:30,608 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-09-03 19:49:30,609 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-09-03 19:49:30,610 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-09-03 19:49:30,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:49:30 BoogieIcfgContainer [2019-09-03 19:49:30,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:49:30,629 INFO L168 Benchmark]: Toolchain (without parser) took 6307.00 ms. Allocated memory was 138.4 MB in the beginning and 328.7 MB in the end (delta: 190.3 MB). Free memory was 85.1 MB in the beginning and 189.5 MB in the end (delta: -104.3 MB). Peak memory consumption was 86.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,630 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.20 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 84.9 MB in the beginning and 171.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,632 INFO L168 Benchmark]: Boogie Preprocessor took 57.59 ms. Allocated memory is still 198.7 MB. Free memory was 171.3 MB in the beginning and 168.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,633 INFO L168 Benchmark]: RCFGBuilder took 779.07 ms. Allocated memory is still 198.7 MB. Free memory was 168.7 MB in the beginning and 120.9 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,634 INFO L168 Benchmark]: TraceAbstraction took 4901.85 ms. Allocated memory was 198.7 MB in the beginning and 328.7 MB in the end (delta: 130.0 MB). Free memory was 120.9 MB in the beginning and 189.5 MB in the end (delta: -68.6 MB). Peak memory consumption was 61.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:30,638 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.46 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 104.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 564.20 ms. Allocated memory was 138.4 MB in the beginning and 198.7 MB in the end (delta: 60.3 MB). Free memory was 84.9 MB in the beginning and 171.3 MB in the end (delta: -86.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.59 ms. Allocated memory is still 198.7 MB. Free memory was 171.3 MB in the beginning and 168.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.07 ms. Allocated memory is still 198.7 MB. Free memory was 168.7 MB in the beginning and 120.9 MB in the end (delta: 47.8 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4901.85 ms. Allocated memory was 198.7 MB in the beginning and 328.7 MB in the end (delta: 130.0 MB). Free memory was 120.9 MB in the beginning and 189.5 MB in the end (delta: -68.6 MB). Peak memory consumption was 61.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. SAFE Result, 4.8s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 805 SDtfs, 1886 SDslu, 912 SDs, 0 SdLazy, 2250 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 43 SyntacticMatches, 53 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 38 HoareAnnotationTreeSize, 9 FomulaSimplifications, 612 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 44554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...