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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:35,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:35,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:35,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:35,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:35,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:35,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:35,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:35,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:35,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:35,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:35,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:35,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:35,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:35,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:35,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:35,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:35,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:35,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:35,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:35,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:35,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:35,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:35,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:35,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:35,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:35,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:35,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:35,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:35,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:35,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:35,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:35,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:35,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:35,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:35,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:35,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:35,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:35,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:35,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:35,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:35,538 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-10-03 02:32:35,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:35,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:35,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:35,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:35,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:35,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:35,556 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:35,556 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:35,556 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:35,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:35,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:35,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:35,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:35,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:35,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:35,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:35,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:35,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:35,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:35,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:35,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:35,560 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:35,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:35,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:35,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:35,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:35,561 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:35,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:35,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:35,561 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:35,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:35,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:35,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:35,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:35,611 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:35,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-03 02:32:35,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417bf3014/00ffc58c4bf54daa9ae89ae109562945/FLAGdfbbce4a2 [2019-10-03 02:32:36,123 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:36,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-03 02:32:36,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417bf3014/00ffc58c4bf54daa9ae89ae109562945/FLAGdfbbce4a2 [2019-10-03 02:32:36,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417bf3014/00ffc58c4bf54daa9ae89ae109562945 [2019-10-03 02:32:36,536 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:36,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:36,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:36,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:36,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:36,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f69be82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36, skipping insertion in model container [2019-10-03 02:32:36,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,554 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:36,587 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:36,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:36,806 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:36,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:36,965 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:36,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36 WrapperNode [2019-10-03 02:32:36,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:36,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:36,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:36,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:36,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:36,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:37,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:37,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (1/1) ... [2019-10-03 02:32:37,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:37,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:37,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:37,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:37,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (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-10-03 02:32:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:37,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:37,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:37,472 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:37,472 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:37,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:37 BoogieIcfgContainer [2019-10-03 02:32:37,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:37,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:37,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:37,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:37,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:36" (1/3) ... [2019-10-03 02:32:37,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9e568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:37, skipping insertion in model container [2019-10-03 02:32:37,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:36" (2/3) ... [2019-10-03 02:32:37,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9e568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:37, skipping insertion in model container [2019-10-03 02:32:37,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:37" (3/3) ... [2019-10-03 02:32:37,483 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-03 02:32:37,493 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:37,502 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-03 02:32:37,521 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-03 02:32:37,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:37,546 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:37,547 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:37,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:37,547 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:37,547 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:37,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:37,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-03 02:32:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:32:37,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:37,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:37,580 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-10-03 02:32:37,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:37,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:37,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:32:37,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:37,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:32:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:32:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:37,785 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-10-03 02:32:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:37,816 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-10-03 02:32:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:32:37,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:32:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:37,829 INFO L225 Difference]: With dead ends: 82 [2019-10-03 02:32:37,829 INFO L226 Difference]: Without dead ends: 76 [2019-10-03 02:32:37,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:32:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-03 02:32:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-10-03 02:32:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-03 02:32:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-03 02:32:37,878 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-10-03 02:32:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:37,878 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-03 02:32:37,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:32:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-03 02:32:37,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:32:37,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:37,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:37,880 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-10-03 02:32:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:37,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:37,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:37,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:37,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:37,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:37,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:37,951 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-03 02:32:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,086 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-10-03 02:32:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:38,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-03 02:32:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,089 INFO L225 Difference]: With dead ends: 101 [2019-10-03 02:32:38,089 INFO L226 Difference]: Without dead ends: 101 [2019-10-03 02:32:38,090 INFO L640 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-10-03 02:32:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-03 02:32:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-10-03 02:32:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-03 02:32:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-03 02:32:38,100 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-10-03 02:32:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,100 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-03 02:32:38,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-03 02:32:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:32:38,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,103 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-10-03 02:32:38,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:38,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:38,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,188 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-10-03 02:32:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,257 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-10-03 02:32:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:38,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-03 02:32:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,259 INFO L225 Difference]: With dead ends: 73 [2019-10-03 02:32:38,259 INFO L226 Difference]: Without dead ends: 73 [2019-10-03 02:32:38,260 INFO L640 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-10-03 02:32:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-03 02:32:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-10-03 02:32:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-03 02:32:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-03 02:32:38,266 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-10-03 02:32:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,267 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-03 02:32:38,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-03 02:32:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-03 02:32:38,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,269 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-10-03 02:32:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:38,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:38,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,320 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-10-03 02:32:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,416 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-10-03 02:32:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:38,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-03 02:32:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,418 INFO L225 Difference]: With dead ends: 94 [2019-10-03 02:32:38,418 INFO L226 Difference]: Without dead ends: 94 [2019-10-03 02:32:38,419 INFO L640 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-10-03 02:32:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-03 02:32:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-10-03 02:32:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-03 02:32:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-03 02:32:38,426 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-10-03 02:32:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,426 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-03 02:32:38,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-03 02:32:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:38,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,428 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-10-03 02:32:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:38,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:38,507 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-10-03 02:32:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,642 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-10-03 02:32:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:38,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-03 02:32:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,644 INFO L225 Difference]: With dead ends: 93 [2019-10-03 02:32:38,644 INFO L226 Difference]: Without dead ends: 93 [2019-10-03 02:32:38,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:32:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-03 02:32:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-10-03 02:32:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-03 02:32:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-03 02:32:38,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-10-03 02:32:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,650 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-03 02:32:38,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-03 02:32:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-03 02:32:38,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,652 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-10-03 02:32:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:38,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:38,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:38,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,711 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-10-03 02:32:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,774 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-10-03 02:32:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:38,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-03 02:32:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,776 INFO L225 Difference]: With dead ends: 67 [2019-10-03 02:32:38,776 INFO L226 Difference]: Without dead ends: 67 [2019-10-03 02:32:38,777 INFO L640 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-10-03 02:32:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-03 02:32:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-10-03 02:32:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-03 02:32:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-03 02:32:38,781 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-03 02:32:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,782 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-03 02:32:38,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-03 02:32:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:38,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,784 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-10-03 02:32:38,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:38,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:38,841 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-10-03 02:32:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:38,909 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-03 02:32:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:38,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-03 02:32:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:38,911 INFO L225 Difference]: With dead ends: 89 [2019-10-03 02:32:38,911 INFO L226 Difference]: Without dead ends: 89 [2019-10-03 02:32:38,912 INFO L640 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-10-03 02:32:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-03 02:32:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-10-03 02:32:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-03 02:32:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-03 02:32:38,916 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-10-03 02:32:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:38,917 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-03 02:32:38,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-03 02:32:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-03 02:32:38,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:38,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:38,918 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:38,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-10-03 02:32:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:38,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:38,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:38,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:38,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:38,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:38,992 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-10-03 02:32:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,127 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-10-03 02:32:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:39,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-03 02:32:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,129 INFO L225 Difference]: With dead ends: 71 [2019-10-03 02:32:39,129 INFO L226 Difference]: Without dead ends: 71 [2019-10-03 02:32:39,129 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:32:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-03 02:32:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-10-03 02:32:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-03 02:32:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-03 02:32:39,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-10-03 02:32:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-03 02:32:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-03 02:32:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:32:39,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,135 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-10-03 02:32:39,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:39,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:39,187 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-10-03 02:32:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,263 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-03 02:32:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:39,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-03 02:32:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,264 INFO L225 Difference]: With dead ends: 59 [2019-10-03 02:32:39,264 INFO L226 Difference]: Without dead ends: 59 [2019-10-03 02:32:39,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:32:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-03 02:32:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-10-03 02:32:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-03 02:32:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-03 02:32:39,269 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-10-03 02:32:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,269 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-03 02:32:39,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-03 02:32:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-03 02:32:39,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,271 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-10-03 02:32:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:39,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:39,313 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-10-03 02:32:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,362 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-10-03 02:32:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:39,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-03 02:32:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,364 INFO L225 Difference]: With dead ends: 59 [2019-10-03 02:32:39,364 INFO L226 Difference]: Without dead ends: 59 [2019-10-03 02:32:39,365 INFO L640 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-10-03 02:32:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-03 02:32:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-10-03 02:32:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-03 02:32:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-03 02:32:39,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-10-03 02:32:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,368 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-03 02:32:39,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-03 02:32:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:32:39,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,370 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-10-03 02:32:39,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:39,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:39,413 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-10-03 02:32:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,490 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-10-03 02:32:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:39,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-03 02:32:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,492 INFO L225 Difference]: With dead ends: 67 [2019-10-03 02:32:39,492 INFO L226 Difference]: Without dead ends: 67 [2019-10-03 02:32:39,493 INFO L640 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-10-03 02:32:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-03 02:32:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-10-03 02:32:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-03 02:32:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-03 02:32:39,499 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-10-03 02:32:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,500 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-03 02:32:39,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-03 02:32:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:32:39,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,501 INFO L411 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-10-03 02:32:39,502 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-10-03 02:32:39,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:39,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:39,575 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-03 02:32:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,677 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-10-03 02:32:39,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:32:39,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-03 02:32:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,678 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:32:39,679 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:32:39,679 INFO L640 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-10-03 02:32:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:32:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-10-03 02:32:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-03 02:32:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-03 02:32:39,685 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-10-03 02:32:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,687 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-03 02:32:39,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-03 02:32:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:32:39,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,690 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-10-03 02:32:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:39,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:39,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:39,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:39,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:39,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:39,790 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-10-03 02:32:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:39,931 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-03 02:32:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:39,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-03 02:32:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:39,932 INFO L225 Difference]: With dead ends: 60 [2019-10-03 02:32:39,932 INFO L226 Difference]: Without dead ends: 60 [2019-10-03 02:32:39,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:32:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-03 02:32:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-10-03 02:32:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-03 02:32:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-03 02:32:39,935 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-10-03 02:32:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:39,936 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-03 02:32:39,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-03 02:32:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:32:39,940 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:39,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:39,941 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-10-03 02:32:39,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:39,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:40,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:40,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:32:40,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:40,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:32:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:32:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:40,030 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-10-03 02:32:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:40,136 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-10-03 02:32:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:40,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-03 02:32:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:40,137 INFO L225 Difference]: With dead ends: 85 [2019-10-03 02:32:40,137 INFO L226 Difference]: Without dead ends: 85 [2019-10-03 02:32:40,138 INFO L640 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-10-03 02:32:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-03 02:32:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-10-03 02:32:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-03 02:32:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-03 02:32:40,145 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-10-03 02:32:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:40,145 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-03 02:32:40,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:32:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-03 02:32:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:32:40,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:40,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:40,147 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:40,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:40,148 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-10-03 02:32:40,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:40,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:40,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:40,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:40,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:40,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:40,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:40,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:40,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:40,212 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-10-03 02:32:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:40,349 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-10-03 02:32:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:40,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-03 02:32:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:40,351 INFO L225 Difference]: With dead ends: 58 [2019-10-03 02:32:40,351 INFO L226 Difference]: Without dead ends: 58 [2019-10-03 02:32:40,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:32:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-03 02:32:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-10-03 02:32:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-03 02:32:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-03 02:32:40,357 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-10-03 02:32:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:40,358 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-03 02:32:40,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-03 02:32:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:32:40,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:40,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:40,363 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-10-03 02:32:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:40,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:40,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:40,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:40,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:40,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:40,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:40,435 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-10-03 02:32:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:40,588 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-10-03 02:32:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:32:40,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-03 02:32:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:40,589 INFO L225 Difference]: With dead ends: 123 [2019-10-03 02:32:40,589 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:32:40,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:32:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:32:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:32:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:32:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:32:40,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-03 02:32:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:40,591 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:32:40,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:32:40,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:32:40,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:32:40 BoogieIcfgContainer [2019-10-03 02:32:40,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:32:40,600 INFO L168 Benchmark]: Toolchain (without parser) took 4061.25 ms. Allocated memory was 142.1 MB in the beginning and 256.4 MB in the end (delta: 114.3 MB). Free memory was 89.8 MB in the beginning and 129.7 MB in the end (delta: -39.9 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,601 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.02 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 89.6 MB in the beginning and 177.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,602 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 175.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,603 INFO L168 Benchmark]: RCFGBuilder took 464.03 ms. Allocated memory is still 199.8 MB. Free memory was 175.4 MB in the beginning and 153.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,604 INFO L168 Benchmark]: TraceAbstraction took 3121.57 ms. Allocated memory was 199.8 MB in the beginning and 256.4 MB in the end (delta: 56.6 MB). Free memory was 153.5 MB in the beginning and 129.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 80.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:32:40,608 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.23 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.02 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 89.6 MB in the beginning and 177.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 175.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.03 ms. Allocated memory is still 199.8 MB. Free memory was 175.4 MB in the beginning and 153.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3121.57 ms. Allocated memory was 199.8 MB in the beginning and 256.4 MB in the end (delta: 56.6 MB). Free memory was 153.5 MB in the beginning and 129.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 80.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: 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: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 3.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1252 SDslu, 802 SDs, 0 SdLazy, 796 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...