java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:55:40,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:55:40,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:55:40,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:55:40,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:55:40,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:55:40,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:55:40,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:55:40,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:55:40,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:55:40,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:55:40,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:55:40,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:55:40,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:55:40,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:55:40,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:55:40,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:55:40,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:55:40,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:55:40,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:55:40,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:55:40,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:55:40,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:55:40,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:55:40,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:55:40,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:55:40,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:55:40,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:55:40,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:55:40,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:55:40,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:55:40,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:55:40,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:55:40,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:55:40,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:55:40,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:55:40,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:55:40,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:55:40,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:55:40,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:55:40,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:55:40,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:55:40,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:55:40,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:55:40,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:55:40,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:55:40,484 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:55:40,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:55:40,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:55:40,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:55:40,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:55:40,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:55:40,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:55:40,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:55:40,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:55:40,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:55:40,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:55:40,486 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:55:40,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:55:40,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:55:40,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:55:40,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:55:40,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:55:40,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:55:40,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:55:40,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:55:40,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:55:40,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:55:40,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:55:40,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:55:40,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:55:40,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:55:40,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:55:40,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:55:40,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:55:40,544 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:55:40,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-08 02:55:40,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23202db8c/e96f6ca404dc4c5ba05158278952162b/FLAGd3006d131 [2019-09-08 02:55:41,018 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:55:41,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-08 02:55:41,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23202db8c/e96f6ca404dc4c5ba05158278952162b/FLAGd3006d131 [2019-09-08 02:55:41,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23202db8c/e96f6ca404dc4c5ba05158278952162b [2019-09-08 02:55:41,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:55:41,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:55:41,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:41,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:55:41,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:55:41,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e9ecad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41, skipping insertion in model container [2019-09-08 02:55:41,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:55:41,419 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:55:41,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:41,664 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:55:41,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:55:41,808 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:55:41,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41 WrapperNode [2019-09-08 02:55:41,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:55:41,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:55:41,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:55:41,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:55:41,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... [2019-09-08 02:55:41,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:55:41,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:55:41,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:55:41,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:55:41,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:55:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:55:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:55:41,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:55:41,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:55:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 02:55:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 02:55:41,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:55:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:55:41,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:55:41,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:55:42,305 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:55:42,305 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 02:55:42,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:42 BoogieIcfgContainer [2019-09-08 02:55:42,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:55:42,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:55:42,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:55:42,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:55:42,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:55:41" (1/3) ... [2019-09-08 02:55:42,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799af699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:42, skipping insertion in model container [2019-09-08 02:55:42,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:55:41" (2/3) ... [2019-09-08 02:55:42,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799af699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:55:42, skipping insertion in model container [2019-09-08 02:55:42,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:55:42" (3/3) ... [2019-09-08 02:55:42,313 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-08 02:55:42,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:55:42,327 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-08 02:55:42,343 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-08 02:55:42,374 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:55:42,375 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:55:42,375 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:55:42,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:55:42,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:55:42,376 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:55:42,376 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:55:42,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:55:42,376 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:55:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-08 02:55:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:55:42,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:42,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:42,403 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:42,408 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-08 02:55:42,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:42,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:42,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:42,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:42,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:42,604 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-08 02:55:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:42,792 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2019-09-08 02:55:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:42,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 02:55:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:42,812 INFO L225 Difference]: With dead ends: 133 [2019-09-08 02:55:42,812 INFO L226 Difference]: Without dead ends: 113 [2019-09-08 02:55:42,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-08 02:55:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-08 02:55:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 02:55:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-08 02:55:42,884 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-08 02:55:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:42,885 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-08 02:55:42,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-08 02:55:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:55:42,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:42,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:42,888 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-08 02:55:42,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:42,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:42,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:42,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:42,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:42,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:42,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:42,988 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-08 02:55:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,086 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-08 02:55:43,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:43,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-08 02:55:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,090 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:55:43,090 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:55:43,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:55:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-08 02:55:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-08 02:55:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-08 02:55:43,106 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-08 02:55:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,106 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-08 02:55:43,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-08 02:55:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 02:55:43,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,109 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-08 02:55:43,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:43,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:43,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:43,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:43,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:43,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:43,189 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-08 02:55:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,270 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-08 02:55:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:43,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-08 02:55:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,272 INFO L225 Difference]: With dead ends: 73 [2019-09-08 02:55:43,273 INFO L226 Difference]: Without dead ends: 71 [2019-09-08 02:55:43,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-08 02:55:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-08 02:55:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-08 02:55:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-08 02:55:43,282 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-08 02:55:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,282 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-08 02:55:43,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-08 02:55:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:55:43,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,285 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-08 02:55:43,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:43,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:43,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:43,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,378 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-08 02:55:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,473 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-08 02:55:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:43,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-08 02:55:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,475 INFO L225 Difference]: With dead ends: 71 [2019-09-08 02:55:43,475 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 02:55:43,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 02:55:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-08 02:55:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 02:55:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-08 02:55:43,495 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-08 02:55:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,495 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-08 02:55:43,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-08 02:55:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 02:55:43,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,497 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,498 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-08 02:55:43,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:43,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:43,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:43,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:43,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:43,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,544 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-08 02:55:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,635 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-08 02:55:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:43,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-08 02:55:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,637 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:55:43,637 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:55:43,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:55:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-08 02:55:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-08 02:55:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-08 02:55:43,644 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-08 02:55:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,644 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-08 02:55:43,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-08 02:55:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:55:43,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,646 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-08 02:55:43,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:43,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:43,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:43,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:43,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,698 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-08 02:55:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,816 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-09-08 02:55:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:43,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-08 02:55:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,818 INFO L225 Difference]: With dead ends: 112 [2019-09-08 02:55:43,818 INFO L226 Difference]: Without dead ends: 110 [2019-09-08 02:55:43,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-08 02:55:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-08 02:55:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-08 02:55:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-08 02:55:43,825 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-08 02:55:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,826 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-08 02:55:43,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-08 02:55:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:55:43,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,828 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,828 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-08 02:55:43,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:43,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:43,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:43,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:43,869 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-08 02:55:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:43,931 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-08 02:55:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:43,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-08 02:55:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:43,938 INFO L225 Difference]: With dead ends: 65 [2019-09-08 02:55:43,939 INFO L226 Difference]: Without dead ends: 61 [2019-09-08 02:55:43,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-08 02:55:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-08 02:55:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 02:55:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-08 02:55:43,947 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-08 02:55:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:43,949 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-08 02:55:43,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-08 02:55:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 02:55:43,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:43,951 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:43,951 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:43,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-08 02:55:43,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:44,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:44,009 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-08 02:55:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,070 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-08 02:55:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:44,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-08 02:55:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,072 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:55:44,072 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 02:55:44,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 02:55:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-08 02:55:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-08 02:55:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-08 02:55:44,078 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-08 02:55:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,079 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-08 02:55:44,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-08 02:55:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:55:44,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,084 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-08 02:55:44,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,148 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-08 02:55:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,245 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-09-08 02:55:44,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:44,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:55:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,247 INFO L225 Difference]: With dead ends: 95 [2019-09-08 02:55:44,247 INFO L226 Difference]: Without dead ends: 93 [2019-09-08 02:55:44,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-08 02:55:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-08 02:55:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-08 02:55:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-08 02:55:44,253 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-08 02:55:44,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,253 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-08 02:55:44,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-08 02:55:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:55:44,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,255 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-08 02:55:44,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,295 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-08 02:55:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,368 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-09-08 02:55:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:44,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:55:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,369 INFO L225 Difference]: With dead ends: 72 [2019-09-08 02:55:44,369 INFO L226 Difference]: Without dead ends: 70 [2019-09-08 02:55:44,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:44,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-08 02:55:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-08 02:55:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-08 02:55:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-08 02:55:44,381 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-08 02:55:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,381 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-08 02:55:44,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-08 02:55:44,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:55:44,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,388 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-08 02:55:44,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,459 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-08 02:55:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,524 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-09-08 02:55:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:44,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 02:55:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,525 INFO L225 Difference]: With dead ends: 53 [2019-09-08 02:55:44,525 INFO L226 Difference]: Without dead ends: 51 [2019-09-08 02:55:44,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-08 02:55:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-08 02:55:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 02:55:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-08 02:55:44,535 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-08 02:55:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,535 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-08 02:55:44,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-08 02:55:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:44,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,537 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-08 02:55:44,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,592 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-08 02:55:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,653 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-09-08 02:55:44,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:44,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,654 INFO L225 Difference]: With dead ends: 50 [2019-09-08 02:55:44,654 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 02:55:44,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 02:55:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-08 02:55:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 02:55:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-08 02:55:44,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-08 02:55:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,658 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-08 02:55:44,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-08 02:55:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:44,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,660 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-08 02:55:44,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,696 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-08 02:55:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,783 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-09-08 02:55:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:44,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,785 INFO L225 Difference]: With dead ends: 69 [2019-09-08 02:55:44,785 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 02:55:44,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 02:55:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-08 02:55:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 02:55:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-08 02:55:44,788 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-08 02:55:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,789 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-08 02:55:44,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-08 02:55:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:44,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,791 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-08 02:55:44,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,829 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-08 02:55:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,894 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-09-08 02:55:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:44,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,896 INFO L225 Difference]: With dead ends: 57 [2019-09-08 02:55:44,896 INFO L226 Difference]: Without dead ends: 55 [2019-09-08 02:55:44,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-08 02:55:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-08 02:55:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 02:55:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-08 02:55:44,900 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-08 02:55:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:44,900 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-08 02:55:44,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-08 02:55:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:55:44,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:44,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:44,902 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-08 02:55:44,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:44,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:44,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:44,945 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-08 02:55:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:44,998 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-08 02:55:44,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 02:55:44,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-08 02:55:44,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:44,999 INFO L225 Difference]: With dead ends: 41 [2019-09-08 02:55:44,999 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 02:55:45,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:55:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 02:55:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-08 02:55:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 02:55:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-08 02:55:45,003 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-08 02:55:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:45,003 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-08 02:55:45,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-08 02:55:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 02:55:45,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:45,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:45,005 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-08 02:55:45,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:55:45,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:55:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:55:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:45,046 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-08 02:55:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:45,118 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-09-08 02:55:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 02:55:45,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-08 02:55:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:45,120 INFO L225 Difference]: With dead ends: 52 [2019-09-08 02:55:45,120 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 02:55:45,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 02:55:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 02:55:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-08 02:55:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 02:55:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-08 02:55:45,124 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-08 02:55:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:45,124 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-08 02:55:45,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:55:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-08 02:55:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 02:55:45,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:45,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:45,126 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-08 02:55:45,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:45,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:45,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:45,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:45,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:45,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:45,152 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-08 02:55:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:45,178 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-08 02:55:45,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:45,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-08 02:55:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:45,179 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:55:45,179 INFO L226 Difference]: Without dead ends: 33 [2019-09-08 02:55:45,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-08 02:55:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-08 02:55:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 02:55:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-08 02:55:45,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-08 02:55:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:45,183 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-08 02:55:45,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-08 02:55:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:55:45,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:55:45,183 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:55:45,184 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:55:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:55:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-08 02:55:45,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:55:45,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:55:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:55:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:55:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:55:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:55:45,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:55:45,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 02:55:45,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 02:55:45,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 02:55:45,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 02:55:45,206 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-08 02:55:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:55:45,244 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-08 02:55:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:55:45,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-08 02:55:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:55:45,245 INFO L225 Difference]: With dead ends: 37 [2019-09-08 02:55:45,245 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:55:45,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:55:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:55:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:55:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:55:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:55:45,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-08 02:55:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:55:45,246 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:55:45,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 02:55:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:55:45,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:55:45,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:55:45,661 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:55:45,661 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:55:45,661 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:55:45,661 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:55:45,661 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:55:45,661 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-09-08 02:55:45,662 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-09-08 02:55:45,663 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-09-08 02:55:45,664 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-09-08 02:55:45,664 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-09-08 02:55:45,665 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-09-08 02:55:45,665 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-09-08 02:55:45,665 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-09-08 02:55:45,665 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-09-08 02:55:45,667 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-09-08 02:55:45,667 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-09-08 02:55:45,668 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-09-08 02:55:45,668 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-09-08 02:55:45,668 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-09-08 02:55:45,668 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-09-08 02:55:45,668 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-09-08 02:55:45,669 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-09-08 02:55:45,669 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-09-08 02:55:45,671 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-09-08 02:55:45,672 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-09-08 02:55:45,673 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-09-08 02:55:45,673 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-09-08 02:55:45,674 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-09-08 02:55:45,675 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-09-08 02:55:45,675 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-09-08 02:55:45,676 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-08 02:55:45,676 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-09-08 02:55:45,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:55:45 BoogieIcfgContainer [2019-09-08 02:55:45,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:55:45,710 INFO L168 Benchmark]: Toolchain (without parser) took 4332.11 ms. Allocated memory was 132.1 MB in the beginning and 264.2 MB in the end (delta: 132.1 MB). Free memory was 88.2 MB in the beginning and 230.3 MB in the end (delta: -142.1 MB). Peak memory consumption was 137.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,712 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.46 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.8 MB in the beginning and 176.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,718 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 199.8 MB. Free memory was 176.5 MB in the beginning and 174.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,719 INFO L168 Benchmark]: RCFGBuilder took 465.57 ms. Allocated memory is still 199.8 MB. Free memory was 174.6 MB in the beginning and 151.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,720 INFO L168 Benchmark]: TraceAbstraction took 3399.00 ms. Allocated memory was 199.8 MB in the beginning and 264.2 MB in the end (delta: 64.5 MB). Free memory was 150.4 MB in the beginning and 230.3 MB in the end (delta: -80.0 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. [2019-09-08 02:55:45,732 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.35 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 431.46 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.8 MB in the beginning and 176.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.78 ms. Allocated memory is still 199.8 MB. Free memory was 176.5 MB in the beginning and 174.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.57 ms. Allocated memory is still 199.8 MB. Free memory was 174.6 MB in the beginning and 151.0 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3399.00 ms. Allocated memory was 199.8 MB in the beginning and 264.2 MB in the end (delta: 64.5 MB). Free memory was 150.4 MB in the beginning and 230.3 MB in the end (delta: -80.0 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 3.3s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 804 SDtfs, 1254 SDslu, 811 SDs, 0 SdLazy, 927 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 63 HoareAnnotationTreeSize, 9 FomulaSimplifications, 49055 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1388 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 9626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...