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-fea9116 [2019-09-20 13:25:34,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:34,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:34,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:34,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:34,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:34,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:34,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:34,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:34,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:34,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:34,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:34,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:34,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:34,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:34,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:34,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:34,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:34,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:34,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:34,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:34,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:34,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:34,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:34,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:34,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:34,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:34,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:34,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:34,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:34,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:34,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:34,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:34,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:34,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:34,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:34,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:34,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:34,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:34,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:34,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:34,516 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-20 13:25:34,530 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:34,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:34,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:34,531 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:34,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:34,532 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:34,532 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:34,532 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:34,533 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:34,533 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:34,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:34,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:34,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:34,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:34,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:34,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:34,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:34,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:34,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:34,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:34,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:34,535 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:34,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:34,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:34,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:34,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:34,536 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:34,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:34,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:34,537 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:34,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:34,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:34,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:34,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:34,580 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:34,581 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-20 13:25:34,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc1b5561/1444da8cb803465ea5066066320bad09/FLAG68430a89c [2019-09-20 13:25:35,115 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:35,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-20 13:25:35,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc1b5561/1444da8cb803465ea5066066320bad09/FLAG68430a89c [2019-09-20 13:25:35,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc1b5561/1444da8cb803465ea5066066320bad09 [2019-09-20 13:25:35,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:35,481 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:35,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:35,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:35,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:35,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acdc5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35, skipping insertion in model container [2019-09-20 13:25:35,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,497 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:35,537 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:35,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:35,730 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:35,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:35,875 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:35,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35 WrapperNode [2019-09-20 13:25:35,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:35,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:35,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:35,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:35,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (1/1) ... [2019-09-20 13:25:35,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:35,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:35,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:35,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:35,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (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-20 13:25:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:35,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:36,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:36,417 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:25:36,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:36 BoogieIcfgContainer [2019-09-20 13:25:36,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:36,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:36,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:36,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:36,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:35" (1/3) ... [2019-09-20 13:25:36,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19388bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:36, skipping insertion in model container [2019-09-20 13:25:36,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:35" (2/3) ... [2019-09-20 13:25:36,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19388bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:36, skipping insertion in model container [2019-09-20 13:25:36,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:36" (3/3) ... [2019-09-20 13:25:36,427 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-20 13:25:36,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:36,444 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-20 13:25:36,459 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-20 13:25:36,485 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:36,485 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:36,485 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:36,486 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:36,486 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:36,486 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:36,486 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:36,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-20 13:25:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:36,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:36,512 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:36,514 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-20 13:25:36,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:36,705 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-20 13:25:36,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:36,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:36,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:36,725 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-20 13:25:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:36,900 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-09-20 13:25:36,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:36,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:25:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:36,914 INFO L225 Difference]: With dead ends: 127 [2019-09-20 13:25:36,914 INFO L226 Difference]: Without dead ends: 113 [2019-09-20 13:25:36,916 INFO L636 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-20 13:25:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-20 13:25:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-20 13:25:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-20 13:25:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-20 13:25:36,961 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-20 13:25:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:36,961 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-20 13:25:36,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-20 13:25:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:36,963 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:36,963 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:36,964 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:36,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-20 13:25:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:36,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:36,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:36,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,025 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-20 13:25:37,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:37,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:37,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:37,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:37,030 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-20 13:25:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:37,109 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-20 13:25:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:37,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:25:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:37,111 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:25:37,111 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 13:25:37,112 INFO L636 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-20 13:25:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 13:25:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-20 13:25:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 13:25:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-20 13:25:37,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-20 13:25:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:37,120 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-20 13:25:37,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-20 13:25:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:25:37,121 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,121 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,122 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-20 13:25:37,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,196 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-20 13:25:37,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:37,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:37,199 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-20 13:25:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:37,279 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-20 13:25:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:37,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-20 13:25:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:37,281 INFO L225 Difference]: With dead ends: 71 [2019-09-20 13:25:37,281 INFO L226 Difference]: Without dead ends: 71 [2019-09-20 13:25:37,282 INFO L636 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-20 13:25:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-20 13:25:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-20 13:25:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:25:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-20 13:25:37,289 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-20 13:25:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:37,290 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-20 13:25:37,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-20 13:25:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:25:37,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,291 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,293 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-20 13:25:37,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,382 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-20 13:25:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:37,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:37,385 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-20 13:25:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:37,481 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-20 13:25:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:37,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-20 13:25:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:37,483 INFO L225 Difference]: With dead ends: 69 [2019-09-20 13:25:37,483 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 13:25:37,483 INFO L636 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-20 13:25:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 13:25:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-20 13:25:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-20 13:25:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-20 13:25:37,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-20 13:25:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:37,490 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-20 13:25:37,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-20 13:25:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:25:37,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,492 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,492 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,493 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-20 13:25:37,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,585 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-20 13:25:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:37,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:37,587 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-20 13:25:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:37,672 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-20 13:25:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:37,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-20 13:25:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:37,674 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:25:37,674 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 13:25:37,675 INFO L636 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-20 13:25:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 13:25:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-20 13:25:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-20 13:25:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-20 13:25:37,680 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-20 13:25:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:37,680 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-20 13:25:37,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-20 13:25:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:37,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,681 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,682 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-20 13:25:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,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-20 13:25:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:37,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:37,750 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-20 13:25:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:37,857 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-09-20 13:25:37,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:37,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-20 13:25:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:37,861 INFO L225 Difference]: With dead ends: 110 [2019-09-20 13:25:37,861 INFO L226 Difference]: Without dead ends: 110 [2019-09-20 13:25:37,861 INFO L636 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-20 13:25:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-20 13:25:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-20 13:25:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 13:25:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-20 13:25:37,874 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-20 13:25:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:37,877 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-20 13:25:37,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-20 13:25:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:37,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,879 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,880 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,880 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-20 13:25:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:37,942 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-20 13:25:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:37,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:37,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:37,944 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-20 13:25:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,026 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-20 13:25:38,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:38,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-20 13:25:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,027 INFO L225 Difference]: With dead ends: 63 [2019-09-20 13:25:38,028 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 13:25:38,028 INFO L636 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-20 13:25:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 13:25:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-20 13:25:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:25:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-20 13:25:38,032 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-20 13:25:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,033 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-20 13:25:38,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-20 13:25:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:25:38,034 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,034 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,035 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-20 13:25:38,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,084 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-20 13:25:38,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:38,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:38,087 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-20 13:25:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,147 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-20 13:25:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:38,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-20 13:25:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,149 INFO L225 Difference]: With dead ends: 59 [2019-09-20 13:25:38,149 INFO L226 Difference]: Without dead ends: 57 [2019-09-20 13:25:38,149 INFO L636 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-20 13:25:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-20 13:25:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-20 13:25:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 13:25:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-20 13:25:38,157 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-20 13:25:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,158 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-20 13:25:38,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-20 13:25:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:25:38,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,164 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,165 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-20 13:25:38,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,257 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-20 13:25:38,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,259 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-20 13:25:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,386 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-09-20 13:25:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:38,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:25:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,388 INFO L225 Difference]: With dead ends: 93 [2019-09-20 13:25:38,388 INFO L226 Difference]: Without dead ends: 93 [2019-09-20 13:25:38,389 INFO L636 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-20 13:25:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-20 13:25:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-20 13:25:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-20 13:25:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-20 13:25:38,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-20 13:25:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,393 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-20 13:25:38,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-20 13:25:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:25:38,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,394 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,395 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-20 13:25:38,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,431 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-20 13:25:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,433 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-20 13:25:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,513 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-20 13:25:38,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:38,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:25:38,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,514 INFO L225 Difference]: With dead ends: 70 [2019-09-20 13:25:38,514 INFO L226 Difference]: Without dead ends: 70 [2019-09-20 13:25:38,515 INFO L636 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-20 13:25:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-20 13:25:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-20 13:25:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:25:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-20 13:25:38,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-20 13:25:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,519 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-20 13:25:38,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-20 13:25:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:25:38,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,520 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,520 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-20 13:25:38,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,566 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-20 13:25:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,568 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-20 13:25:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,654 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-20 13:25:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:38,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-20 13:25:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,655 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:25:38,655 INFO L226 Difference]: Without dead ends: 51 [2019-09-20 13:25:38,656 INFO L636 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-20 13:25:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-20 13:25:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-20 13:25:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 13:25:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-20 13:25:38,659 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-20 13:25:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,659 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-20 13:25:38,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-20 13:25:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:38,660 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,660 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,661 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-20 13:25:38,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,719 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-20 13:25:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,721 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-20 13:25:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,774 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-20 13:25:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:38,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:25:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,775 INFO L225 Difference]: With dead ends: 48 [2019-09-20 13:25:38,775 INFO L226 Difference]: Without dead ends: 48 [2019-09-20 13:25:38,776 INFO L636 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-20 13:25:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-20 13:25:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-20 13:25:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-20 13:25:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-20 13:25:38,779 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-20 13:25:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,780 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-20 13:25:38,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-20 13:25:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:38,781 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,781 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,781 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-20 13:25:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,818 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-20 13:25:38,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,820 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-20 13:25:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,914 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-20 13:25:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:38,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:25:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,915 INFO L225 Difference]: With dead ends: 67 [2019-09-20 13:25:38,915 INFO L226 Difference]: Without dead ends: 67 [2019-09-20 13:25:38,916 INFO L636 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-20 13:25:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-20 13:25:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-20 13:25:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:25:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-20 13:25:38,918 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-20 13:25:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,918 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-20 13:25:38,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-20 13:25:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:38,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,920 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,921 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-20 13:25:38,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,970 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-20 13:25:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,973 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-20 13:25:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,051 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-09-20 13:25:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:39,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:25:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,053 INFO L225 Difference]: With dead ends: 55 [2019-09-20 13:25:39,053 INFO L226 Difference]: Without dead ends: 55 [2019-09-20 13:25:39,053 INFO L636 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-20 13:25:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-20 13:25:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-20 13:25:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-20 13:25:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-20 13:25:39,056 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-20 13:25:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,056 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-20 13:25:39,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-20 13:25:39,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:25:39,058 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,058 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,060 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-20 13:25:39,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,109 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-20 13:25:39,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:39,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:39,111 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-20 13:25:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,176 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-20 13:25:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:39,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-20 13:25:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,177 INFO L225 Difference]: With dead ends: 39 [2019-09-20 13:25:39,177 INFO L226 Difference]: Without dead ends: 37 [2019-09-20 13:25:39,178 INFO L636 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-20 13:25:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-20 13:25:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-20 13:25:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-20 13:25:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-20 13:25:39,180 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-20 13:25:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,180 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-20 13:25:39,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-20 13:25:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:39,181 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,181 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,182 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-20 13:25:39,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,227 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-20 13:25:39,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:39,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:39,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:39,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:39,228 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-20 13:25:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,311 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-20 13:25:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:39,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-20 13:25:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,312 INFO L225 Difference]: With dead ends: 50 [2019-09-20 13:25:39,312 INFO L226 Difference]: Without dead ends: 50 [2019-09-20 13:25:39,313 INFO L636 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-20 13:25:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-20 13:25:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-20 13:25:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 13:25:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-20 13:25:39,315 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-20 13:25:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,315 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-20 13:25:39,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-20 13:25:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:25:39,316 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,317 INFO L407 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-20 13:25:39,317 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-20 13:25:39,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,355 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-20 13:25:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:39,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:39,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:39,357 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-20 13:25:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,459 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-09-20 13:25:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:39,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-20 13:25:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,462 INFO L225 Difference]: With dead ends: 54 [2019-09-20 13:25:39,462 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:25:39,463 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-20 13:25:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:25:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-09-20 13:25:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-20 13:25:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-20 13:25:39,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-20 13:25:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,466 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-20 13:25:39,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-20 13:25:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:25:39,467 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,467 INFO L407 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-20 13:25:39,468 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-20 13:25:39,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,497 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-20 13:25:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:39,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:39,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:39,498 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-20 13:25:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,540 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-20 13:25:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:39,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-20 13:25:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,541 INFO L225 Difference]: With dead ends: 35 [2019-09-20 13:25:39,541 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:25:39,541 INFO L636 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-20 13:25:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:25:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:25:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:25:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:25:39,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-20 13:25:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,542 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:25:39,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:25:39,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:25:39,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:25:39 BoogieIcfgContainer [2019-09-20 13:25:39,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:25:39,551 INFO L168 Benchmark]: Toolchain (without parser) took 4069.52 ms. Allocated memory was 137.9 MB in the beginning and 270.5 MB in the end (delta: 132.6 MB). Free memory was 85.3 MB in the beginning and 124.4 MB in the end (delta: -39.1 MB). Peak memory consumption was 93.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:39,552 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory is still 103.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:25:39,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.76 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 85.3 MB in the beginning and 176.0 MB in the end (delta: -90.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:39,554 INFO L168 Benchmark]: Boogie Preprocessor took 38.46 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 174.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:39,554 INFO L168 Benchmark]: RCFGBuilder took 503.09 ms. Allocated memory is still 198.7 MB. Free memory was 174.1 MB in the beginning and 150.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:39,555 INFO L168 Benchmark]: TraceAbstraction took 3129.40 ms. Allocated memory was 198.7 MB in the beginning and 270.5 MB in the end (delta: 71.8 MB). Free memory was 149.3 MB in the beginning and 124.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:39,559 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 137.9 MB. Free memory is still 103.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.76 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 85.3 MB in the beginning and 176.0 MB in the end (delta: -90.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.46 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 174.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.09 ms. Allocated memory is still 198.7 MB. Free memory was 174.1 MB in the beginning and 150.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3129.40 ms. Allocated memory was 198.7 MB in the beginning and 270.5 MB in the end (delta: 71.8 MB). Free memory was 149.3 MB in the beginning and 124.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: 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: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: 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: 305]: 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: 110]: 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: 220]: 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: 346]: 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: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 801 SDtfs, 1345 SDslu, 811 SDs, 0 SdLazy, 998 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s 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, 230 StatesRemovedByMinimization, 15 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, 10044 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...