java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:01:08,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:01:08,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:01:08,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:01:08,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:01:08,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:01:08,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:01:08,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:01:08,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:01:08,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:01:08,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:01:08,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:01:08,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:01:08,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:01:08,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:01:08,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:01:08,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:01:08,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:01:08,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:01:08,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:01:08,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:01:08,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:01:08,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:01:08,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:01:08,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:01:08,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:01:08,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:01:08,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:01:08,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:01:08,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:01:08,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:01:08,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:01:08,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:01:08,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:01:08,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:01:08,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:01:08,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:01:08,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:01:08,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:01:08,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:01:08,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:01:08,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:01:08,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:01:08,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:01:08,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:01:08,267 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:01:08,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:01:08,268 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:01:08,268 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:01:08,268 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:01:08,269 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:01:08,269 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:01:08,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:01:08,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:01:08,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:01:08,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:01:08,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:01:08,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:01:08,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:01:08,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:01:08,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:01:08,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:01:08,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:01:08,273 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:01:08,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:01:08,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:08,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:01:08,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:01:08,275 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:01:08,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:01:08,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:01:08,275 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:01:08,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:01:08,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:01:08,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:01:08,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:01:08,351 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:01:08,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-05 13:01:08,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cd32a27/3f74f03240c64a019b9694a8d1857c2a/FLAGd1f1188a4 [2019-09-05 13:01:08,889 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:01:08,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-09-05 13:01:08,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cd32a27/3f74f03240c64a019b9694a8d1857c2a/FLAGd1f1188a4 [2019-09-05 13:01:09,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8cd32a27/3f74f03240c64a019b9694a8d1857c2a [2019-09-05 13:01:09,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:01:09,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:01:09,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:09,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:01:09,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:01:09,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9fcb14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09, skipping insertion in model container [2019-09-05 13:01:09,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,258 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:01:09,298 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:01:09,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,599 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:01:09,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:01:09,779 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:01:09,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09 WrapperNode [2019-09-05 13:01:09,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:01:09,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:01:09,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:01:09,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... [2019-09-05 13:01:09,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:01:09,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:01:09,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:01:09,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:01:09,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:01:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:01:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:01:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:01:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:01:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:01:10,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:01:10,308 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 13:01:10,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:10 BoogieIcfgContainer [2019-09-05 13:01:10,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:01:10,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:01:10,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:01:10,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:01:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:01:09" (1/3) ... [2019-09-05 13:01:10,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee8935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:10, skipping insertion in model container [2019-09-05 13:01:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:01:09" (2/3) ... [2019-09-05 13:01:10,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ee8935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:01:10, skipping insertion in model container [2019-09-05 13:01:10,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:01:10" (3/3) ... [2019-09-05 13:01:10,317 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-09-05 13:01:10,327 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:01:10,334 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-05 13:01:10,350 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-05 13:01:10,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:01:10,377 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:01:10,377 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:01:10,377 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:01:10,377 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:01:10,378 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:01:10,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:01:10,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:01:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-09-05 13:01:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:10,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:10,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-09-05 13:01:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:10,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:10,636 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-09-05 13:01:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:10,835 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-09-05 13:01:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:10,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:10,848 INFO L225 Difference]: With dead ends: 127 [2019-09-05 13:01:10,848 INFO L226 Difference]: Without dead ends: 113 [2019-09-05 13:01:10,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-05 13:01:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-09-05 13:01:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-05 13:01:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-05 13:01:10,903 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-09-05 13:01:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:10,904 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-05 13:01:10,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-05 13:01:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:01:10,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:10,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:10,907 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-09-05 13:01:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:10,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:10,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:10,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:10,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:10,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:10,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:10,985 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-09-05 13:01:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,074 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-05 13:01:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:11,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-05 13:01:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,078 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:01:11,078 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:01:11,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:01:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 13:01:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 13:01:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-05 13:01:11,091 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-09-05 13:01:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,092 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-05 13:01:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-05 13:01:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 13:01:11,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,097 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-09-05 13:01:11,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:11,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:11,180 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-09-05 13:01:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,272 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-05 13:01:11,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-05 13:01:11,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,275 INFO L225 Difference]: With dead ends: 71 [2019-09-05 13:01:11,275 INFO L226 Difference]: Without dead ends: 71 [2019-09-05 13:01:11,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-05 13:01:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-09-05 13:01:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 13:01:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-09-05 13:01:11,291 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-09-05 13:01:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,292 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-09-05 13:01:11,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-09-05 13:01:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:01:11,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,302 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-09-05 13:01:11,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,370 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-09-05 13:01:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,473 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-09-05 13:01:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:01:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,475 INFO L225 Difference]: With dead ends: 69 [2019-09-05 13:01:11,476 INFO L226 Difference]: Without dead ends: 69 [2019-09-05 13:01:11,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-05 13:01:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-09-05 13:01:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-05 13:01:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-09-05 13:01:11,497 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-09-05 13:01:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,497 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-09-05 13:01:11,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-09-05 13:01:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:01:11,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,499 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-09-05 13:01:11,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,580 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-09-05 13:01:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,673 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-09-05 13:01:11,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:01:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,676 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:01:11,676 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:01:11,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:01:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-09-05 13:01:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-05 13:01:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-05 13:01:11,687 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-09-05 13:01:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,688 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-05 13:01:11,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-05 13:01:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:01:11,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,690 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-09-05 13:01:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:11,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,752 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-09-05 13:01:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,860 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-09-05 13:01:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:11,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-05 13:01:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,862 INFO L225 Difference]: With dead ends: 110 [2019-09-05 13:01:11,862 INFO L226 Difference]: Without dead ends: 110 [2019-09-05 13:01:11,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-05 13:01:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-09-05 13:01:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-05 13:01:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-09-05 13:01:11,867 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-09-05 13:01:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,868 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-09-05 13:01:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-09-05 13:01:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:01:11,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,870 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-09-05 13:01:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:11,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:11,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:11,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:11,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:11,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:11,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:11,905 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-09-05 13:01:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:11,971 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-09-05 13:01:11,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:11,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 13:01:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:11,973 INFO L225 Difference]: With dead ends: 63 [2019-09-05 13:01:11,973 INFO L226 Difference]: Without dead ends: 61 [2019-09-05 13:01:11,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-05 13:01:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-05 13:01:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-05 13:01:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-09-05 13:01:11,977 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-09-05 13:01:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:11,978 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-09-05 13:01:11,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-09-05 13:01:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 13:01:11,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:11,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:11,980 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-09-05 13:01:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:11,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:12,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:12,016 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-09-05 13:01:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,066 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-09-05 13:01:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:12,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-05 13:01:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,067 INFO L225 Difference]: With dead ends: 59 [2019-09-05 13:01:12,067 INFO L226 Difference]: Without dead ends: 57 [2019-09-05 13:01:12,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-05 13:01:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-05 13:01:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-05 13:01:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-05 13:01:12,071 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-09-05 13:01:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,072 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-05 13:01:12,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-05 13:01:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:12,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-09-05 13:01:12,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,140 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-09-05 13:01:12,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,254 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-09-05 13:01:12,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:12,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,256 INFO L225 Difference]: With dead ends: 93 [2019-09-05 13:01:12,256 INFO L226 Difference]: Without dead ends: 93 [2019-09-05 13:01:12,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-05 13:01:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-09-05 13:01:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 13:01:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-05 13:01:12,262 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-09-05 13:01:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,263 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-05 13:01:12,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-05 13:01:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:12,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,268 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-09-05 13:01:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,327 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-05 13:01:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,391 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-05 13:01:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:12,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,393 INFO L225 Difference]: With dead ends: 70 [2019-09-05 13:01:12,393 INFO L226 Difference]: Without dead ends: 70 [2019-09-05 13:01:12,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-05 13:01:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-09-05 13:01:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-05 13:01:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-05 13:01:12,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-09-05 13:01:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,397 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-05 13:01:12,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-05 13:01:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-05 13:01:12,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,399 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-09-05 13:01:12,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,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-09-05 13:01:12,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,432 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-09-05 13:01:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,494 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-05 13:01:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:12,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-05 13:01:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,495 INFO L225 Difference]: With dead ends: 51 [2019-09-05 13:01:12,495 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:01:12,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:01:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 13:01:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:01:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-05 13:01:12,499 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-09-05 13:01:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,500 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-05 13:01:12,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-05 13:01:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:12,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,502 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-09-05 13:01:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,549 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-09-05 13:01:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,609 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-09-05 13:01:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:12,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,610 INFO L225 Difference]: With dead ends: 48 [2019-09-05 13:01:12,610 INFO L226 Difference]: Without dead ends: 48 [2019-09-05 13:01:12,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-05 13:01:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-09-05 13:01:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 13:01:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-05 13:01:12,613 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-05 13:01:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,614 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-05 13:01:12,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-05 13:01:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:12,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,615 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-09-05 13:01:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,645 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-05 13:01:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,749 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-09-05 13:01:12,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:12,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,750 INFO L225 Difference]: With dead ends: 67 [2019-09-05 13:01:12,750 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 13:01:12,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 13:01:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-09-05 13:01:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:01:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 13:01:12,754 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-05 13:01:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,754 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 13:01:12,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 13:01:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:12,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,756 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-09-05 13:01:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,830 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-05 13:01:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:12,912 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-09-05 13:01:12,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:12,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:12,913 INFO L225 Difference]: With dead ends: 55 [2019-09-05 13:01:12,913 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 13:01:12,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 13:01:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-09-05 13:01:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 13:01:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 13:01:12,916 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-09-05 13:01:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:12,916 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 13:01:12,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 13:01:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 13:01:12,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:12,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:12,918 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-09-05 13:01:12,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:12,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:12,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:12,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:12,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:12,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:12,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:12,968 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-09-05 13:01:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,025 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-05 13:01:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:01:13,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-05 13:01:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,026 INFO L225 Difference]: With dead ends: 39 [2019-09-05 13:01:13,026 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:01:13,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:01:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:01:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 13:01:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 13:01:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 13:01:13,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-09-05 13:01:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,031 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 13:01:13,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 13:01:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-05 13:01:13,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:13,035 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-09-05 13:01:13,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:01:13,097 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:01:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:01:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,099 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-09-05 13:01:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,168 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-09-05 13:01:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:01:13,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-05 13:01:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,170 INFO L225 Difference]: With dead ends: 50 [2019-09-05 13:01:13,170 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 13:01:13,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:01:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 13:01:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-09-05 13:01:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:01:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 13:01:13,173 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-09-05 13:01:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,173 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 13:01:13,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:01:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 13:01:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:01:13,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:13,177 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-09-05 13:01:13,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:13,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:13,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:13,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:13,214 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-05 13:01:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,238 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-09-05 13:01:13,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:13,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 13:01:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,239 INFO L225 Difference]: With dead ends: 33 [2019-09-05 13:01:13,239 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 13:01:13,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 13:01:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 13:01:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 13:01:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 13:01:13,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-09-05 13:01:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,242 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 13:01:13,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 13:01:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 13:01:13,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:01:13,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:01:13,244 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:01:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:01:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-09-05 13:01:13,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:01:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:01:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:01:13,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:01:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:01:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:01:13,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:01:13,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 13:01:13,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:01:13,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 13:01:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 13:01:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 13:01:13,277 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-05 13:01:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:01:13,316 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-09-05 13:01:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:01:13,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-05 13:01:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:01:13,316 INFO L225 Difference]: With dead ends: 35 [2019-09-05 13:01:13,316 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 13:01:13,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:01:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 13:01:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 13:01:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 13:01:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 13:01:13,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-05 13:01:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:01:13,319 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 13:01:13,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 13:01:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 13:01:13,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 13:01:13,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 01:01:13 BoogieIcfgContainer [2019-09-05 13:01:13,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 13:01:13,331 INFO L168 Benchmark]: Toolchain (without parser) took 4084.38 ms. Allocated memory was 132.6 MB in the beginning and 263.2 MB in the end (delta: 130.5 MB). Free memory was 88.5 MB in the beginning and 133.0 MB in the end (delta: -44.5 MB). Peak memory consumption was 86.1 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,333 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.12 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 176.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,339 INFO L168 Benchmark]: Boogie Preprocessor took 50.55 ms. Allocated memory is still 199.2 MB. Free memory was 175.9 MB in the beginning and 174.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,340 INFO L168 Benchmark]: RCFGBuilder took 477.83 ms. Allocated memory is still 199.2 MB. Free memory was 174.2 MB in the beginning and 150.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,341 INFO L168 Benchmark]: TraceAbstraction took 3015.98 ms. Allocated memory was 199.2 MB in the beginning and 263.2 MB in the end (delta: 64.0 MB). Free memory was 150.0 MB in the beginning and 133.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:01:13,346 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.22 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 536.12 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 176.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.55 ms. Allocated memory is still 199.2 MB. Free memory was 175.9 MB in the beginning and 174.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.83 ms. Allocated memory is still 199.2 MB. Free memory was 174.2 MB in the beginning and 150.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3015.98 ms. Allocated memory was 199.2 MB in the beginning and 263.2 MB in the end (delta: 64.0 MB). Free memory was 150.0 MB in the beginning and 133.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 2.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 804 SDtfs, 1305 SDslu, 806 SDs, 0 SdLazy, 926 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 209 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 9626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...