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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:27,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:27,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:27,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:27,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:27,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:27,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:27,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:27,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:27,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:27,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:27,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:27,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:27,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:27,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:27,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:27,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:27,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:27,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:27,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:27,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:27,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:27,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:27,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:27,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:27,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:27,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:27,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:27,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:27,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:27,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:27,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:27,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:27,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:27,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:27,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:27,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:27,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:27,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:27,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:27,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:27,502 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-10 02:04:27,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:27,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:27,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:27,517 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:27,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:27,518 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:27,518 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:27,518 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:27,518 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:27,519 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:27,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:27,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:27,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:27,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:27,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:27,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:27,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:27,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:27,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:27,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:27,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:27,522 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:27,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:27,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:27,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:27,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:27,523 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:27,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:27,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:27,523 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:27,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:27,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:27,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:27,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:27,576 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:27,577 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-10 02:04:27,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db424d07d/980dcfe3c28e4133b5081b5115dbc00c/FLAG1c65ea392 [2019-09-10 02:04:28,142 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:28,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-10 02:04:28,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db424d07d/980dcfe3c28e4133b5081b5115dbc00c/FLAG1c65ea392 [2019-09-10 02:04:28,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db424d07d/980dcfe3c28e4133b5081b5115dbc00c [2019-09-10 02:04:28,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:28,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:28,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:28,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:28,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:28,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:28" (1/1) ... [2019-09-10 02:04:28,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cedd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:28, skipping insertion in model container [2019-09-10 02:04:28,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:28" (1/1) ... [2019-09-10 02:04:28,573 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:28,602 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:28,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:28,858 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:28,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:29,011 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:29,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29 WrapperNode [2019-09-10 02:04:29,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:29,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:29,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:29,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:29,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (1/1) ... [2019-09-10 02:04:29,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:29,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:29,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:29,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:29,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (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-10 02:04:29,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:29,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:04:29,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:29,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:29,517 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:29,518 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:29,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:29 BoogieIcfgContainer [2019-09-10 02:04:29,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:29,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:29,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:29,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:29,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:28" (1/3) ... [2019-09-10 02:04:29,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3bc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:29, skipping insertion in model container [2019-09-10 02:04:29,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:29" (2/3) ... [2019-09-10 02:04:29,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3bc5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:29, skipping insertion in model container [2019-09-10 02:04:29,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:29" (3/3) ... [2019-09-10 02:04:29,527 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-10 02:04:29,536 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:29,547 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-10 02:04:29,565 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-10 02:04:29,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:29,593 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:29,593 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:29,593 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:29,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:29,594 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:29,594 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:29,594 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-10 02:04:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:29,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:29,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:29,628 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-10 02:04:29,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:29,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:29,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:29,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:29,863 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-10 02:04:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:29,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:29,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:29,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:29,892 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-10 02:04:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,141 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-09-10 02:04:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,157 INFO L225 Difference]: With dead ends: 127 [2019-09-10 02:04:30,158 INFO L226 Difference]: Without dead ends: 113 [2019-09-10 02:04:30,162 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-10 02:04:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-10 02:04:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-10 02:04:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-10 02:04:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-10 02:04:30,230 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-10 02:04:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,231 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-10 02:04:30,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-10 02:04:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-10 02:04:30,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,234 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-10 02:04:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,305 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-10 02:04:30,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:30,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:30,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:30,309 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-10 02:04:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,400 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-10 02:04:30,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:30,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-10 02:04:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,403 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:30,403 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:30,405 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-10 02:04:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-10 02:04:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 02:04:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-10 02:04:30,419 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-10 02:04:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,420 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-10 02:04:30,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-10 02:04:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:30,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,423 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-10 02:04:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,499 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-10 02:04:30,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:30,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:30,505 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-10 02:04:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,592 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-10 02:04:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 02:04:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,594 INFO L225 Difference]: With dead ends: 71 [2019-09-10 02:04:30,594 INFO L226 Difference]: Without dead ends: 71 [2019-09-10 02:04:30,595 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-10 02:04:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-10 02:04:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-10 02:04:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-10 02:04:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-10 02:04:30,602 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-10 02:04:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,602 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-10 02:04:30,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-10 02:04:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:30,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,605 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-10 02:04:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,654 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-10 02:04:30,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,656 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-10 02:04:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,777 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-10 02:04:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:04:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,778 INFO L225 Difference]: With dead ends: 69 [2019-09-10 02:04:30,779 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 02:04:30,779 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-10 02:04:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 02:04:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-10 02:04:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 02:04:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-10 02:04:30,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-10 02:04:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,794 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-10 02:04:30,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,794 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-10 02:04:30,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:30,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,796 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,797 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-10 02:04:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:30,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:30,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:30,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:30,859 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-10 02:04:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:30,939 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-10 02:04:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:30,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-10 02:04:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:30,940 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:30,941 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:30,941 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-10 02:04:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-10 02:04:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 02:04:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-10 02:04:30,946 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-10 02:04:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:30,947 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-10 02:04:30,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-10 02:04:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:30,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:30,948 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:30,949 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-10 02:04:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:30,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:30,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,001 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-10 02:04:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,003 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-10 02:04:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,110 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-09-10 02:04:31,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-10 02:04:31,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,112 INFO L225 Difference]: With dead ends: 110 [2019-09-10 02:04:31,112 INFO L226 Difference]: Without dead ends: 110 [2019-09-10 02:04:31,113 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-10 02:04:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-10 02:04:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-10 02:04:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-10 02:04:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-10 02:04:31,118 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-10 02:04:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,119 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-10 02:04:31,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-10 02:04:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:31,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-10 02:04:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,161 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-10 02:04:31,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:31,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:31,163 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-10 02:04:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,229 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-10 02:04:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:31,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,230 INFO L225 Difference]: With dead ends: 63 [2019-09-10 02:04:31,230 INFO L226 Difference]: Without dead ends: 61 [2019-09-10 02:04:31,231 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-10 02:04:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-10 02:04:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-10 02:04:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-10 02:04:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-10 02:04:31,235 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-10 02:04:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,235 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-10 02:04:31,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-10 02:04:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 02:04:31,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,237 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-10 02:04:31,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,272 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-10 02:04:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:31,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:31,274 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-10 02:04:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,327 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-10 02:04:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:31,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 02:04:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,329 INFO L225 Difference]: With dead ends: 59 [2019-09-10 02:04:31,329 INFO L226 Difference]: Without dead ends: 57 [2019-09-10 02:04:31,330 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-10 02:04:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-10 02:04:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-10 02:04:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-10 02:04:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-10 02:04:31,336 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-10 02:04:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,337 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-10 02:04:31,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-10 02:04:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:31,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,341 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-10 02:04:31,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:04:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,448 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-10 02:04:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,554 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-09-10 02:04:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:31,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,557 INFO L225 Difference]: With dead ends: 93 [2019-09-10 02:04:31,558 INFO L226 Difference]: Without dead ends: 93 [2019-09-10 02:04:31,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-10 02:04:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-10 02:04:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-10 02:04:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-10 02:04:31,569 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-10 02:04:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,569 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-10 02:04:31,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-10 02:04:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:31,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,571 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-10 02:04:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,617 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-10 02:04:31,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,619 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-10 02:04:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,689 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-10 02:04:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,691 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:04:31,691 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 02:04:31,691 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-10 02:04:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 02:04:31,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-10 02:04:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-10 02:04:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-10 02:04:31,695 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-10 02:04:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,695 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-10 02:04:31,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-10 02:04:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 02:04:31,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:31,697 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-10 02:04:31,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,748 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-10 02:04:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,751 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-10 02:04:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,822 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-10 02:04:31,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:31,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 02:04:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,823 INFO L225 Difference]: With dead ends: 51 [2019-09-10 02:04:31,823 INFO L226 Difference]: Without dead ends: 51 [2019-09-10 02:04:31,824 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-10 02:04:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-10 02:04:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-10 02:04:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-10 02:04:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-10 02:04:31,827 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-10 02:04:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,827 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-10 02:04:31,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-10 02:04:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,828 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-10 02:04:31,829 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-10 02:04:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:31,896 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-10 02:04:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:31,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:31,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:31,898 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-10 02:04:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:31,962 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-10 02:04:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:31,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:31,963 INFO L225 Difference]: With dead ends: 48 [2019-09-10 02:04:31,963 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 02:04:31,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 02:04:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-10 02:04:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-10 02:04:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-10 02:04:31,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-10 02:04:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:31,967 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-10 02:04:31,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-10 02:04:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:31,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:31,969 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-10 02:04:31,970 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-10 02:04:31,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:31,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:31,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,009 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-10 02:04:32,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:32,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:32,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:32,011 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-10 02:04:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,090 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-10 02:04:32,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:32,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,092 INFO L225 Difference]: With dead ends: 67 [2019-09-10 02:04:32,092 INFO L226 Difference]: Without dead ends: 67 [2019-09-10 02:04:32,092 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-10 02:04:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-10 02:04:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-10 02:04:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-10 02:04:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-10 02:04:32,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-10 02:04:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,095 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-10 02:04:32,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-10 02:04:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:32,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,096 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-10 02:04:32,096 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-10 02:04:32,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,141 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-10 02:04:32,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:32,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:32,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:32,143 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-10 02:04:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,216 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-09-10 02:04:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:32,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,217 INFO L225 Difference]: With dead ends: 55 [2019-09-10 02:04:32,218 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 02:04:32,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 02:04:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-10 02:04:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-10 02:04:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-10 02:04:32,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-10 02:04:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,221 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-10 02:04:32,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-10 02:04:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 02:04:32,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,222 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-10 02:04:32,222 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-10 02:04:32,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,260 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-10 02:04:32,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:32,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:32,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:32,261 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-10 02:04:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,329 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-10 02:04:32,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:32,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 02:04:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,330 INFO L225 Difference]: With dead ends: 39 [2019-09-10 02:04:32,330 INFO L226 Difference]: Without dead ends: 37 [2019-09-10 02:04:32,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-10 02:04:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-10 02:04:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-10 02:04:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-10 02:04:32,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-10 02:04:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,333 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-10 02:04:32,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-10 02:04:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 02:04:32,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,334 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-10 02:04:32,335 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-10 02:04:32,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,376 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-10 02:04:32,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:04:32,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:04:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:04:32,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:04:32,378 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-10 02:04:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,449 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-10 02:04:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:04:32,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-10 02:04:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,450 INFO L225 Difference]: With dead ends: 50 [2019-09-10 02:04:32,450 INFO L226 Difference]: Without dead ends: 50 [2019-09-10 02:04:32,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:04:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-10 02:04:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-10 02:04:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 02:04:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 02:04:32,454 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-10 02:04:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,454 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 02:04:32,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:04:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 02:04:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:04:32,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,456 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-10 02:04:32,457 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-10 02:04:32,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,488 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-10 02:04:32,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:32,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:32,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:32,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:32,489 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-10 02:04:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,513 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-10 02:04:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:32,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-10 02:04:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,514 INFO L225 Difference]: With dead ends: 33 [2019-09-10 02:04:32,514 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:04:32,514 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-10 02:04:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:04:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:04:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:04:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 02:04:32,518 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-10 02:04:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,518 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 02:04:32,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 02:04:32,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:04:32,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:32,519 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-10 02:04:32,519 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-10 02:04:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:32,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:32,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:32,549 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-10 02:04:32,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:32,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:32,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:32,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:32,552 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-10 02:04:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:32,588 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-10 02:04:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:04:32,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 02:04:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:32,589 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:04:32,589 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:32,589 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-10 02:04:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:32,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-10 02:04:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:32,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:32,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:32 BoogieIcfgContainer [2019-09-10 02:04:32,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:32,598 INFO L168 Benchmark]: Toolchain (without parser) took 4040.51 ms. Allocated memory was 132.1 MB in the beginning and 260.0 MB in the end (delta: 127.9 MB). Free memory was 88.7 MB in the beginning and 129.0 MB in the end (delta: -40.3 MB). Peak memory consumption was 87.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,599 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.83 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 174.5 MB in the end (delta: -86.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,600 INFO L168 Benchmark]: Boogie Preprocessor took 38.41 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 172.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,601 INFO L168 Benchmark]: RCFGBuilder took 468.32 ms. Allocated memory is still 199.2 MB. Free memory was 172.6 MB in the beginning and 149.3 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,602 INFO L168 Benchmark]: TraceAbstraction took 3075.82 ms. Allocated memory was 199.2 MB in the beginning and 260.0 MB in the end (delta: 60.8 MB). Free memory was 149.3 MB in the beginning and 129.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:32,605 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.6 MB in the beginning and 106.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 453.83 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 88.5 MB in the beginning and 174.5 MB in the end (delta: -86.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.41 ms. Allocated memory is still 199.2 MB. Free memory was 174.5 MB in the beginning and 172.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 468.32 ms. Allocated memory is still 199.2 MB. Free memory was 172.6 MB in the beginning and 149.3 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3075.82 ms. Allocated memory was 199.2 MB in the beginning and 260.0 MB in the end (delta: 60.8 MB). Free memory was 149.3 MB in the beginning and 129.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 81.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 3.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 804 SDtfs, 1305 SDslu, 806 SDs, 0 SdLazy, 926 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 9626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...