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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:55,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:55,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:55,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:55,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:55,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:55,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:55,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:55,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:55,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:55,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:55,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:55,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:55,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:55,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:55,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:55,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:55,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:55,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:55,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:55,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:55,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:55,479 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:55,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:55,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:55,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:55,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:55,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:55,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:55,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:55,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:55,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:55,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:55,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:55,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:55,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:55,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:55,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:55,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:55,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:55,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:55,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:51:55,523 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:55,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:55,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:55,525 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:55,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:55,525 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:55,526 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:55,526 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:55,526 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:55,526 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:55,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:55,529 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:55,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:55,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:55,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:55,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:55,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:55,530 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:55,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:55,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:55,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:55,531 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:55,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:55,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:55,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:55,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:55,532 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:55,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:55,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:55,533 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:55,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:55,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:55,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:55,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:55,607 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:55,608 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-03 20:51:55,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675f13185/852d162328ee48be90e43c13b8561fae/FLAG09dd521ac [2019-09-03 20:51:56,200 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:56,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2019-09-03 20:51:56,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675f13185/852d162328ee48be90e43c13b8561fae/FLAG09dd521ac [2019-09-03 20:51:56,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675f13185/852d162328ee48be90e43c13b8561fae [2019-09-03 20:51:56,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:56,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:56,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:56,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:56,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:56,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:56" (1/1) ... [2019-09-03 20:51:56,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e08cfec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:56, skipping insertion in model container [2019-09-03 20:51:56,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:56" (1/1) ... [2019-09-03 20:51:56,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:56,546 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:57,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:57,175 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:57,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:57,401 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:57,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57 WrapperNode [2019-09-03 20:51:57,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:57,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:57,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:57,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:57,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... [2019-09-03 20:51:57,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:57,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:57,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:57,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:57,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:57,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:57,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:57,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:51:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:59,373 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:59,376 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:59,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:59 BoogieIcfgContainer [2019-09-03 20:51:59,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:59,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:59,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:59,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:59,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:56" (1/3) ... [2019-09-03 20:51:59,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3d6795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:59, skipping insertion in model container [2019-09-03 20:51:59,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:57" (2/3) ... [2019-09-03 20:51:59,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3d6795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:59, skipping insertion in model container [2019-09-03 20:51:59,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:59" (3/3) ... [2019-09-03 20:51:59,392 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2019-09-03 20:51:59,403 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:59,419 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-03 20:51:59,437 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-03 20:51:59,481 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:59,481 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:59,482 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:59,482 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:59,483 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:59,483 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:59,483 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:59,483 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2019-09-03 20:51:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 20:51:59,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:59,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:59,533 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:59,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1490721617, now seen corresponding path program 1 times [2019-09-03 20:51:59,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:59,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:59,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:59,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:59,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:59,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:59,803 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 4 states. [2019-09-03 20:52:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:00,721 INFO L93 Difference]: Finished difference Result 313 states and 558 transitions. [2019-09-03 20:52:00,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:00,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-03 20:52:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:00,746 INFO L225 Difference]: With dead ends: 313 [2019-09-03 20:52:00,746 INFO L226 Difference]: Without dead ends: 302 [2019-09-03 20:52:00,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-03 20:52:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2019-09-03 20:52:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-03 20:52:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2019-09-03 20:52:00,809 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2019-09-03 20:52:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:00,809 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2019-09-03 20:52:00,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2019-09-03 20:52:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:52:00,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:00,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:00,811 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1032267068, now seen corresponding path program 1 times [2019-09-03 20:52:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:00,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:00,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-03 20:52:00,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:00,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:00,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:00,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:00,870 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand 4 states. [2019-09-03 20:52:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,332 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-09-03 20:52:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:01,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:52:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,335 INFO L225 Difference]: With dead ends: 307 [2019-09-03 20:52:01,335 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:52:01,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:52:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2019-09-03 20:52:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-03 20:52:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2019-09-03 20:52:01,358 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2019-09-03 20:52:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,359 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2019-09-03 20:52:01,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2019-09-03 20:52:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 20:52:01,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,361 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1016017071, now seen corresponding path program 1 times [2019-09-03 20:52:01,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:01,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:01,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:01,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:01,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:01,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:01,412 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand 4 states. [2019-09-03 20:52:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:01,976 INFO L93 Difference]: Finished difference Result 295 states and 358 transitions. [2019-09-03 20:52:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:01,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 20:52:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:01,979 INFO L225 Difference]: With dead ends: 295 [2019-09-03 20:52:01,979 INFO L226 Difference]: Without dead ends: 295 [2019-09-03 20:52:01,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-03 20:52:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-03 20:52:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-03 20:52:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2019-09-03 20:52:01,991 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2019-09-03 20:52:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:01,992 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2019-09-03 20:52:01,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2019-09-03 20:52:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:52:01,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:01,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:01,993 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1431755048, now seen corresponding path program 1 times [2019-09-03 20:52:01,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:01,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:02,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:02,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:02,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:02,041 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand 4 states. [2019-09-03 20:52:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:02,390 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2019-09-03 20:52:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:02,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-03 20:52:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:02,398 INFO L225 Difference]: With dead ends: 298 [2019-09-03 20:52:02,398 INFO L226 Difference]: Without dead ends: 298 [2019-09-03 20:52:02,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-03 20:52:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-03 20:52:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-03 20:52:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2019-09-03 20:52:02,408 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2019-09-03 20:52:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:02,409 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2019-09-03 20:52:02,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2019-09-03 20:52:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:52:02,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:02,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:02,410 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:02,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1526969604, now seen corresponding path program 1 times [2019-09-03 20:52:02,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:02,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:02,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:02,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:02,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:02,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:02,458 INFO L87 Difference]: Start difference. First operand 298 states and 361 transitions. Second operand 5 states. [2019-09-03 20:52:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:03,019 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-09-03 20:52:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:03,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 20:52:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:03,021 INFO L225 Difference]: With dead ends: 296 [2019-09-03 20:52:03,022 INFO L226 Difference]: Without dead ends: 296 [2019-09-03 20:52:03,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-03 20:52:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-03 20:52:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-03 20:52:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2019-09-03 20:52:03,031 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2019-09-03 20:52:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:03,031 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2019-09-03 20:52:03,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2019-09-03 20:52:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:52:03,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:03,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:03,033 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash -91414371, now seen corresponding path program 1 times [2019-09-03 20:52:03,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:03,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:03,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:03,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:03,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:03,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:03,091 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand 4 states. [2019-09-03 20:52:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:03,413 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2019-09-03 20:52:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:03,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 20:52:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:03,417 INFO L225 Difference]: With dead ends: 294 [2019-09-03 20:52:03,417 INFO L226 Difference]: Without dead ends: 292 [2019-09-03 20:52:03,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-03 20:52:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-03 20:52:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-03 20:52:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-09-03 20:52:03,429 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2019-09-03 20:52:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-09-03 20:52:03,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-09-03 20:52:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:03,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:03,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:03,433 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash -922816985, now seen corresponding path program 1 times [2019-09-03 20:52:03,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:03,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:03,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:03,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:03,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:03,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:03,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:03,556 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 5 states. [2019-09-03 20:52:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,180 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2019-09-03 20:52:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:04,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,183 INFO L225 Difference]: With dead ends: 290 [2019-09-03 20:52:04,184 INFO L226 Difference]: Without dead ends: 290 [2019-09-03 20:52:04,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-03 20:52:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-09-03 20:52:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-03 20:52:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 350 transitions. [2019-09-03 20:52:04,192 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 350 transitions. Word has length 17 [2019-09-03 20:52:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,192 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 350 transitions. [2019-09-03 20:52:04,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 350 transitions. [2019-09-03 20:52:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:04,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,194 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1474389837, now seen corresponding path program 1 times [2019-09-03 20:52:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:04,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:04,236 INFO L87 Difference]: Start difference. First operand 287 states and 350 transitions. Second operand 5 states. [2019-09-03 20:52:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:04,817 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2019-09-03 20:52:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:04,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:04,820 INFO L225 Difference]: With dead ends: 305 [2019-09-03 20:52:04,820 INFO L226 Difference]: Without dead ends: 305 [2019-09-03 20:52:04,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-03 20:52:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 285. [2019-09-03 20:52:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-09-03 20:52:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 348 transitions. [2019-09-03 20:52:04,828 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 348 transitions. Word has length 17 [2019-09-03 20:52:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:04,828 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 348 transitions. [2019-09-03 20:52:04,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 348 transitions. [2019-09-03 20:52:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 20:52:04,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:04,833 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:04,833 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1475929037, now seen corresponding path program 1 times [2019-09-03 20:52:04,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:04,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:04,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:04,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:04,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:04,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:04,920 INFO L87 Difference]: Start difference. First operand 285 states and 348 transitions. Second operand 5 states. [2019-09-03 20:52:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:05,469 INFO L93 Difference]: Finished difference Result 286 states and 349 transitions. [2019-09-03 20:52:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:05,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 20:52:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:05,470 INFO L225 Difference]: With dead ends: 286 [2019-09-03 20:52:05,470 INFO L226 Difference]: Without dead ends: 286 [2019-09-03 20:52:05,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-03 20:52:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-03 20:52:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-03 20:52:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-09-03 20:52:05,477 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 17 [2019-09-03 20:52:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:05,477 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-09-03 20:52:05,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-09-03 20:52:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:05,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:05,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:05,479 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1537186772, now seen corresponding path program 1 times [2019-09-03 20:52:05,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:05,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:05,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:05,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:05,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:05,539 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 5 states. [2019-09-03 20:52:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:06,218 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2019-09-03 20:52:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:06,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:06,220 INFO L225 Difference]: With dead ends: 304 [2019-09-03 20:52:06,220 INFO L226 Difference]: Without dead ends: 304 [2019-09-03 20:52:06,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-03 20:52:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2019-09-03 20:52:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-03 20:52:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-09-03 20:52:06,227 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 18 [2019-09-03 20:52:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:06,227 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-09-03 20:52:06,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-09-03 20:52:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:06,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:06,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:06,229 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1538552192, now seen corresponding path program 1 times [2019-09-03 20:52:06,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:06,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:06,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:06,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:06,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:06,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:06,325 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 5 states. [2019-09-03 20:52:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,075 INFO L93 Difference]: Finished difference Result 293 states and 358 transitions. [2019-09-03 20:52:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:07,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,077 INFO L225 Difference]: With dead ends: 293 [2019-09-03 20:52:07,077 INFO L226 Difference]: Without dead ends: 293 [2019-09-03 20:52:07,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-03 20:52:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 279. [2019-09-03 20:52:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-03 20:52:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-09-03 20:52:07,085 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 18 [2019-09-03 20:52:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,086 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-09-03 20:52:07,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-09-03 20:52:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:52:07,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,088 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1490836942, now seen corresponding path program 1 times [2019-09-03 20:52:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:07,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:07,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:07,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:07,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:07,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:07,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:07,175 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 5 states. [2019-09-03 20:52:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:07,741 INFO L93 Difference]: Finished difference Result 277 states and 340 transitions. [2019-09-03 20:52:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:52:07,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 20:52:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:07,743 INFO L225 Difference]: With dead ends: 277 [2019-09-03 20:52:07,743 INFO L226 Difference]: Without dead ends: 275 [2019-09-03 20:52:07,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:52:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-03 20:52:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-09-03 20:52:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-03 20:52:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-09-03 20:52:07,749 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 18 [2019-09-03 20:52:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:07,749 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-09-03 20:52:07,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-09-03 20:52:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:52:07,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:07,750 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:07,751 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -408146528, now seen corresponding path program 1 times [2019-09-03 20:52:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:07,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:07,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:07,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:07,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:07,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:07,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:07,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:07,814 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 5 states. [2019-09-03 20:52:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,486 INFO L93 Difference]: Finished difference Result 288 states and 353 transitions. [2019-09-03 20:52:08,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:08,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 20:52:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,489 INFO L225 Difference]: With dead ends: 288 [2019-09-03 20:52:08,489 INFO L226 Difference]: Without dead ends: 288 [2019-09-03 20:52:08,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-03 20:52:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 273. [2019-09-03 20:52:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-09-03 20:52:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 336 transitions. [2019-09-03 20:52:08,498 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 336 transitions. Word has length 19 [2019-09-03 20:52:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,499 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 336 transitions. [2019-09-03 20:52:08,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 336 transitions. [2019-09-03 20:52:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:52:08,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,501 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1079809725, now seen corresponding path program 1 times [2019-09-03 20:52:08,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:08,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:08,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:08,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:08,534 INFO L87 Difference]: Start difference. First operand 273 states and 336 transitions. Second operand 4 states. [2019-09-03 20:52:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:08,809 INFO L93 Difference]: Finished difference Result 271 states and 334 transitions. [2019-09-03 20:52:08,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:08,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 20:52:08,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:08,812 INFO L225 Difference]: With dead ends: 271 [2019-09-03 20:52:08,812 INFO L226 Difference]: Without dead ends: 271 [2019-09-03 20:52:08,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-03 20:52:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-09-03 20:52:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-03 20:52:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-09-03 20:52:08,821 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 20 [2019-09-03 20:52:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:08,824 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-09-03 20:52:08,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-09-03 20:52:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:52:08,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:08,825 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:08,826 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash 885640025, now seen corresponding path program 1 times [2019-09-03 20:52:08,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:08,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:52:08,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:08,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:52:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:52:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:52:08,893 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 4 states. [2019-09-03 20:52:09,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:09,247 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2019-09-03 20:52:09,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 20:52:09,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 20:52:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:09,249 INFO L225 Difference]: With dead ends: 272 [2019-09-03 20:52:09,249 INFO L226 Difference]: Without dead ends: 254 [2019-09-03 20:52:09,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-03 20:52:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-09-03 20:52:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-03 20:52:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-09-03 20:52:09,255 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 21 [2019-09-03 20:52:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:09,255 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-09-03 20:52:09,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:52:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-09-03 20:52:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-03 20:52:09,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:09,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:09,260 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 317164964, now seen corresponding path program 1 times [2019-09-03 20:52:09,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:09,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:09,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:09,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:11,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:11,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-03 20:52:11,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:11,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-03 20:52:11,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-03 20:52:11,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=2013, Unknown=0, NotChecked=0, Total=3906 [2019-09-03 20:52:11,465 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 63 states. [2019-09-03 20:52:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:12,708 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2019-09-03 20:52:12,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-03 20:52:12,708 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-03 20:52:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:12,711 INFO L225 Difference]: With dead ends: 253 [2019-09-03 20:52:12,711 INFO L226 Difference]: Without dead ends: 253 [2019-09-03 20:52:12,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2019-09-03 20:52:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-03 20:52:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-09-03 20:52:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-03 20:52:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-09-03 20:52:12,719 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2019-09-03 20:52:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:12,720 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-09-03 20:52:12,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-03 20:52:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-09-03 20:52:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-03 20:52:12,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:52:12,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:52:12,723 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:52:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:52:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1242183539, now seen corresponding path program 1 times [2019-09-03 20:52:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:52:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:52:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:52:12,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:52:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:52:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:52:13,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:52:13,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:52:13,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:52:13,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:52:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:52:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:52:13,959 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 5 states. [2019-09-03 20:52:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:52:14,503 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-09-03 20:52:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:52:14,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-03 20:52:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:52:14,505 INFO L225 Difference]: With dead ends: 252 [2019-09-03 20:52:14,505 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:52:14,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 5 SyntacticMatches, 174 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:52:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:52:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:52:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:52:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:52:14,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2019-09-03 20:52:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:52:14,507 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:52:14,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:52:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:52:14,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:52:14,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:52:14 BoogieIcfgContainer [2019-09-03 20:52:14,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:52:14,516 INFO L168 Benchmark]: Toolchain (without parser) took 18064.56 ms. Allocated memory was 132.1 MB in the beginning and 479.7 MB in the end (delta: 347.6 MB). Free memory was 86.3 MB in the beginning and 86.0 MB in the end (delta: 277.3 kB). Peak memory consumption was 347.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,517 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 950.90 ms. Allocated memory was 132.1 MB in the beginning and 202.4 MB in the end (delta: 70.3 MB). Free memory was 86.1 MB in the beginning and 158.1 MB in the end (delta: -72.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,519 INFO L168 Benchmark]: Boogie Preprocessor took 202.73 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 153.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,520 INFO L168 Benchmark]: RCFGBuilder took 1774.26 ms. Allocated memory was 202.4 MB in the beginning and 224.9 MB in the end (delta: 22.5 MB). Free memory was 153.1 MB in the beginning and 106.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,520 INFO L168 Benchmark]: TraceAbstraction took 15132.29 ms. Allocated memory was 224.9 MB in the beginning and 479.7 MB in the end (delta: 254.8 MB). Free memory was 106.9 MB in the beginning and 86.0 MB in the end (delta: 20.9 MB). Peak memory consumption was 275.7 MB. Max. memory is 7.1 GB. [2019-09-03 20:52:14,525 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.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 950.90 ms. Allocated memory was 132.1 MB in the beginning and 202.4 MB in the end (delta: 70.3 MB). Free memory was 86.1 MB in the beginning and 158.1 MB in the end (delta: -72.1 MB). Peak memory consumption was 41.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.73 ms. Allocated memory is still 202.4 MB. Free memory was 158.1 MB in the beginning and 153.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1774.26 ms. Allocated memory was 202.4 MB in the beginning and 224.9 MB in the end (delta: 22.5 MB). Free memory was 153.1 MB in the beginning and 106.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15132.29 ms. Allocated memory was 224.9 MB in the beginning and 479.7 MB in the end (delta: 254.8 MB). Free memory was 106.9 MB in the beginning and 86.0 MB in the end (delta: 20.9 MB). Peak memory consumption was 275.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 309 locations, 16 error locations. SAFE Result, 15.0s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2745 SDtfs, 9352 SDslu, 3041 SDs, 0 SdLazy, 8200 SolverSat, 2430 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 42 SyntacticMatches, 179 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred 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, 17 MinimizatonAttempts, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 589126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...