java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:32:45,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:32:45,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:32:45,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:32:45,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:32:45,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:32:45,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:32:45,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:32:45,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:32:45,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:32:45,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:32:45,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:32:45,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:32:45,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:32:45,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:32:45,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:32:45,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:32:45,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:32:45,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:32:45,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:32:45,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:32:45,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:32:45,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:32:45,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:32:45,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:32:45,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:32:45,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:32:45,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:32:45,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:32:45,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:32:45,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:32:45,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:32:45,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:32:45,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:32:45,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:32:45,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:32:45,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:32:45,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:32:45,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:32:45,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:32:45,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:32:45,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:32:45,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:32:45,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:32:45,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:32:45,381 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:32:45,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:32:45,382 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:32:45,382 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:32:45,383 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:32:45,383 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:32:45,383 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:32:45,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:32:45,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:32:45,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:32:45,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:32:45,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:32:45,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:32:45,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:32:45,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:32:45,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:32:45,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:32:45,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:32:45,386 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:32:45,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:32:45,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:45,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:32:45,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:32:45,387 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:32:45,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:32:45,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:32:45,388 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:32:45,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:32:45,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:32:45,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:32:45,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:32:45,435 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:32:45,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-03 02:32:45,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c036107c9/e903b4f7f21d4ed99867f18fe43167ac/FLAG6a83919ec [2019-10-03 02:32:46,093 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:32:46,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-03 02:32:46,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c036107c9/e903b4f7f21d4ed99867f18fe43167ac/FLAG6a83919ec [2019-10-03 02:32:46,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c036107c9/e903b4f7f21d4ed99867f18fe43167ac [2019-10-03 02:32:46,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:32:46,330 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:32:46,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:46,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:32:46,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:32:46,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:46" (1/1) ... [2019-10-03 02:32:46,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7354cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:46, skipping insertion in model container [2019-10-03 02:32:46,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:32:46" (1/1) ... [2019-10-03 02:32:46,347 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:32:46,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:32:47,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:47,483 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:32:47,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:32:47,788 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:32:47,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47 WrapperNode [2019-10-03 02:32:47,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:32:47,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:32:47,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:32:47,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:32:47,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:47,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... [2019-10-03 02:32:48,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:32:48,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:32:48,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:32:48,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:32:48,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:32:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:32:48,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:32:48,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:32:48,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:32:48,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 02:32:48,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:32:48,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:32:48,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:32:48,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:32:48,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:32:50,284 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:32:50,284 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:32:50,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:50 BoogieIcfgContainer [2019-10-03 02:32:50,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:32:50,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:32:50,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:32:50,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:32:50,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:32:46" (1/3) ... [2019-10-03 02:32:50,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d18d4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:50, skipping insertion in model container [2019-10-03 02:32:50,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:32:47" (2/3) ... [2019-10-03 02:32:50,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d18d4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:32:50, skipping insertion in model container [2019-10-03 02:32:50,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:32:50" (3/3) ... [2019-10-03 02:32:50,315 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-10-03 02:32:50,327 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:32:50,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-03 02:32:50,358 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-03 02:32:50,391 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:32:50,391 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:32:50,391 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:32:50,392 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:32:50,392 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:32:50,392 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:32:50,392 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:32:50,392 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:32:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-10-03 02:32:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-03 02:32:50,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:50,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:50,443 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:50,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-10-03 02:32:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:50,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:50,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:50,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:50,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:50,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:50,724 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-10-03 02:32:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,052 INFO L93 Difference]: Finished difference Result 484 states and 894 transitions. [2019-10-03 02:32:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:52,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-03 02:32:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,068 INFO L225 Difference]: With dead ends: 484 [2019-10-03 02:32:52,068 INFO L226 Difference]: Without dead ends: 301 [2019-10-03 02:32:52,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-03 02:32:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-03 02:32:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-03 02:32:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-10-03 02:32:52,133 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-10-03 02:32:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,133 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-10-03 02:32:52,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-10-03 02:32:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:32:52,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,135 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,136 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-10-03 02:32:52,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:52,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:52,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:32:52,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:52,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:32:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:32:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:32:52,236 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-10-03 02:32:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:52,663 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-10-03 02:32:52,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:32:52,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-03 02:32:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:52,667 INFO L225 Difference]: With dead ends: 299 [2019-10-03 02:32:52,667 INFO L226 Difference]: Without dead ends: 296 [2019-10-03 02:32:52,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:32:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-03 02:32:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-10-03 02:32:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-03 02:32:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-10-03 02:32:52,701 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-10-03 02:32:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:52,701 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-10-03 02:32:52,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:32:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-10-03 02:32:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:32:52,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:52,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:52,718 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-10-03 02:32:52,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:52,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:52,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:55,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:55,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-03 02:32:55,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:55,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-03 02:32:55,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-03 02:32:55,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-10-03 02:32:55,439 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-10-03 02:32:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:56,652 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-10-03 02:32:56,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-03 02:32:56,653 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-10-03 02:32:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:56,657 INFO L225 Difference]: With dead ends: 295 [2019-10-03 02:32:56,657 INFO L226 Difference]: Without dead ends: 295 [2019-10-03 02:32:56,658 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-10-03 02:32:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-03 02:32:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-10-03 02:32:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-03 02:32:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-10-03 02:32:56,670 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-10-03 02:32:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:56,671 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-10-03 02:32:56,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-03 02:32:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-10-03 02:32:56,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 02:32:56,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:56,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:56,675 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-10-03 02:32:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:56,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:56,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:32:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:32:57,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:32:57,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:32:57,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:32:57,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:32:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:32:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:32:57,683 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-10-03 02:32:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:32:58,326 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-10-03 02:32:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:32:58,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-10-03 02:32:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:32:58,335 INFO L225 Difference]: With dead ends: 294 [2019-10-03 02:32:58,336 INFO L226 Difference]: Without dead ends: 294 [2019-10-03 02:32:58,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:32:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-03 02:32:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-10-03 02:32:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 02:32:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-10-03 02:32:58,344 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-10-03 02:32:58,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:32:58,345 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-10-03 02:32:58,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:32:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-10-03 02:32:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-03 02:32:58,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:32:58,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:32:58,350 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:32:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:32:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-10-03 02:32:58,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:32:58,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:58,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:32:58,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:32:58,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:32:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:00,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-03 02:33:00,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:00,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-03 02:33:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-03 02:33:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-03 02:33:00,694 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-10-03 02:33:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:02,451 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-10-03 02:33:02,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-03 02:33:02,452 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-10-03 02:33:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:02,456 INFO L225 Difference]: With dead ends: 293 [2019-10-03 02:33:02,456 INFO L226 Difference]: Without dead ends: 293 [2019-10-03 02:33:02,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-03 02:33:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-10-03 02:33:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-03 02:33:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-10-03 02:33:02,469 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-10-03 02:33:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:02,472 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-10-03 02:33:02,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-03 02:33:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-10-03 02:33:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-03 02:33:02,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:02,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:02,479 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-10-03 02:33:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:02,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:02,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:02,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:03,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:03,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:33:03,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:03,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:33:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:33:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:33:03,362 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-10-03 02:33:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:04,001 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-10-03 02:33:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:33:04,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-10-03 02:33:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:04,005 INFO L225 Difference]: With dead ends: 288 [2019-10-03 02:33:04,005 INFO L226 Difference]: Without dead ends: 288 [2019-10-03 02:33:04,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:33:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-03 02:33:04,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-10-03 02:33:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-03 02:33:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-10-03 02:33:04,012 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-10-03 02:33:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:04,013 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-10-03 02:33:04,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:33:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-10-03 02:33:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-03 02:33:04,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:04,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:04,017 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-10-03 02:33:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:04,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:04,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:04,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:06,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:06,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-03 02:33:06,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:06,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 02:33:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 02:33:06,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:06,238 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 66 states. [2019-10-03 02:33:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:07,948 INFO L93 Difference]: Finished difference Result 296 states and 300 transitions. [2019-10-03 02:33:07,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 02:33:07,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-10-03 02:33:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:07,951 INFO L225 Difference]: With dead ends: 296 [2019-10-03 02:33:07,952 INFO L226 Difference]: Without dead ends: 296 [2019-10-03 02:33:07,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-03 02:33:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-03 02:33:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 286. [2019-10-03 02:33:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-03 02:33:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-10-03 02:33:07,963 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-10-03 02:33:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:07,964 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-10-03 02:33:07,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 02:33:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-10-03 02:33:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:33:07,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:07,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:07,968 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-10-03 02:33:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:07,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:07,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:08,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:33:08,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:08,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:33:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:33:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:33:08,149 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-10-03 02:33:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:08,477 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-10-03 02:33:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:33:08,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-10-03 02:33:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:08,481 INFO L225 Difference]: With dead ends: 284 [2019-10-03 02:33:08,481 INFO L226 Difference]: Without dead ends: 282 [2019-10-03 02:33:08,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:33:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-03 02:33:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-10-03 02:33:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-03 02:33:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-10-03 02:33:08,490 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-10-03 02:33:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:08,491 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-10-03 02:33:08,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:33:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-10-03 02:33:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-03 02:33:08,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:08,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:08,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:08,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-10-03 02:33:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:08,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:08,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:10,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:10,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-03 02:33:10,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:10,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 02:33:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 02:33:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:10,427 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-10-03 02:33:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:11,943 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2019-10-03 02:33:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 02:33:11,945 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-10-03 02:33:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:11,946 INFO L225 Difference]: With dead ends: 290 [2019-10-03 02:33:11,946 INFO L226 Difference]: Without dead ends: 290 [2019-10-03 02:33:11,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-03 02:33:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-03 02:33:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-10-03 02:33:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-03 02:33:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-10-03 02:33:11,955 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-10-03 02:33:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:11,955 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-10-03 02:33:11,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 02:33:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-10-03 02:33:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-03 02:33:11,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:11,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:11,958 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-10-03 02:33:11,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:11,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:11,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:11,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:13,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:13,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-03 02:33:13,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:13,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-03 02:33:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-03 02:33:13,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-03 02:33:13,819 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-10-03 02:33:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:15,277 INFO L93 Difference]: Finished difference Result 296 states and 301 transitions. [2019-10-03 02:33:15,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-03 02:33:15,279 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-10-03 02:33:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:15,282 INFO L225 Difference]: With dead ends: 296 [2019-10-03 02:33:15,282 INFO L226 Difference]: Without dead ends: 296 [2019-10-03 02:33:15,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-03 02:33:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-10-03 02:33:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-03 02:33:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-10-03 02:33:15,290 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-10-03 02:33:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:15,291 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-10-03 02:33:15,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-03 02:33:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-10-03 02:33:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:33:15,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:15,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:15,294 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-10-03 02:33:15,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:15,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:15,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:15,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:17,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:17,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-03 02:33:17,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:17,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-03 02:33:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-03 02:33:17,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-03 02:33:17,216 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-10-03 02:33:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:18,702 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-10-03 02:33:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-03 02:33:18,704 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-10-03 02:33:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:18,706 INFO L225 Difference]: With dead ends: 299 [2019-10-03 02:33:18,706 INFO L226 Difference]: Without dead ends: 299 [2019-10-03 02:33:18,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-03 02:33:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-10-03 02:33:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-03 02:33:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-10-03 02:33:18,719 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-10-03 02:33:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:18,720 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-10-03 02:33:18,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-03 02:33:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-10-03 02:33:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:33:18,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:18,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:18,725 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-10-03 02:33:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:18,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:19,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:19,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:33:19,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:19,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:33:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:33:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:33:19,521 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states. [2019-10-03 02:33:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:20,141 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-10-03 02:33:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:33:20,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-03 02:33:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:20,144 INFO L225 Difference]: With dead ends: 274 [2019-10-03 02:33:20,144 INFO L226 Difference]: Without dead ends: 272 [2019-10-03 02:33:20,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:33:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-03 02:33:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-10-03 02:33:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-10-03 02:33:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2019-10-03 02:33:20,150 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 258 [2019-10-03 02:33:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:20,151 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2019-10-03 02:33:20,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:33:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2019-10-03 02:33:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-03 02:33:20,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:20,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:20,154 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash -607235764, now seen corresponding path program 1 times [2019-10-03 02:33:20,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:20,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:20,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:33:20,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:20,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:33:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:33:20,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:33:20,923 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand 6 states. [2019-10-03 02:33:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:21,649 INFO L93 Difference]: Finished difference Result 280 states and 285 transitions. [2019-10-03 02:33:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:33:21,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-10-03 02:33:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:21,654 INFO L225 Difference]: With dead ends: 280 [2019-10-03 02:33:21,654 INFO L226 Difference]: Without dead ends: 280 [2019-10-03 02:33:21,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:33:21,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-03 02:33:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2019-10-03 02:33:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-10-03 02:33:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2019-10-03 02:33:21,662 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2019-10-03 02:33:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:21,663 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2019-10-03 02:33:21,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:33:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2019-10-03 02:33:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-03 02:33:21,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:21,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:21,668 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -153040543, now seen corresponding path program 1 times [2019-10-03 02:33:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:21,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:22,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:22,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:33:22,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:22,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:33:22,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:33:22,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:33:22,318 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand 6 states. [2019-10-03 02:33:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:22,984 INFO L93 Difference]: Finished difference Result 283 states and 288 transitions. [2019-10-03 02:33:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:33:22,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-10-03 02:33:22,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:22,988 INFO L225 Difference]: With dead ends: 283 [2019-10-03 02:33:22,988 INFO L226 Difference]: Without dead ends: 283 [2019-10-03 02:33:22,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 123 SyntacticMatches, 61 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:33:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-03 02:33:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2019-10-03 02:33:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-03 02:33:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2019-10-03 02:33:22,994 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2019-10-03 02:33:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:22,995 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2019-10-03 02:33:22,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:33:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2019-10-03 02:33:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-03 02:33:22,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:22,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:22,998 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash 562136719, now seen corresponding path program 1 times [2019-10-03 02:33:22,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:23,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:25,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:25,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-03 02:33:25,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-03 02:33:25,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-03 02:33:25,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-03 02:33:25,015 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand 66 states. [2019-10-03 02:33:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:26,407 INFO L93 Difference]: Finished difference Result 276 states and 280 transitions. [2019-10-03 02:33:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-03 02:33:26,407 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 260 [2019-10-03 02:33:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:26,410 INFO L225 Difference]: With dead ends: 276 [2019-10-03 02:33:26,410 INFO L226 Difference]: Without dead ends: 276 [2019-10-03 02:33:26,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-03 02:33:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-03 02:33:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 266. [2019-10-03 02:33:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-03 02:33:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2019-10-03 02:33:26,418 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2019-10-03 02:33:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:26,419 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2019-10-03 02:33:26,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-03 02:33:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2019-10-03 02:33:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-03 02:33:26,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:33:26,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:33:26,422 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:33:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:33:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash 246374009, now seen corresponding path program 1 times [2019-10-03 02:33:26,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:33:26,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:26,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:33:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:33:26,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:33:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:33:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:33:26,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:33:26,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:33:26,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:33:26,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:33:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:33:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:33:26,635 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand 4 states. [2019-10-03 02:33:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:33:27,047 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2019-10-03 02:33:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:33:27,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-10-03 02:33:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:33:27,049 INFO L225 Difference]: With dead ends: 264 [2019-10-03 02:33:27,049 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:33:27,050 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:33:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:33:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:33:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:33:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:33:27,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-10-03 02:33:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:33:27,052 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:33:27,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:33:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:33:27,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:33:27,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:33:27 BoogieIcfgContainer [2019-10-03 02:33:27,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:33:27,066 INFO L168 Benchmark]: Toolchain (without parser) took 40733.82 ms. Allocated memory was 134.7 MB in the beginning and 865.6 MB in the end (delta: 730.9 MB). Free memory was 81.0 MB in the beginning and 715.6 MB in the end (delta: -634.6 MB). Peak memory consumption was 96.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,070 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 102.3 MB in the beginning and 102.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1458.01 ms. Allocated memory was 134.7 MB in the beginning and 208.7 MB in the end (delta: 73.9 MB). Free memory was 80.8 MB in the beginning and 148.0 MB in the end (delta: -67.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,079 INFO L168 Benchmark]: Boogie Preprocessor took 211.03 ms. Allocated memory is still 208.7 MB. Free memory was 148.0 MB in the beginning and 139.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,080 INFO L168 Benchmark]: RCFGBuilder took 2285.95 ms. Allocated memory was 208.7 MB in the beginning and 283.1 MB in the end (delta: 74.4 MB). Free memory was 139.4 MB in the beginning and 226.7 MB in the end (delta: -87.3 MB). Peak memory consumption was 146.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,082 INFO L168 Benchmark]: TraceAbstraction took 36771.72 ms. Allocated memory was 283.1 MB in the beginning and 865.6 MB in the end (delta: 582.5 MB). Free memory was 226.7 MB in the beginning and 715.6 MB in the end (delta: -488.9 MB). Peak memory consumption was 93.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:33:27,094 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 134.7 MB. Free memory was 102.3 MB in the beginning and 102.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1458.01 ms. Allocated memory was 134.7 MB in the beginning and 208.7 MB in the end (delta: 73.9 MB). Free memory was 80.8 MB in the beginning and 148.0 MB in the end (delta: -67.2 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 211.03 ms. Allocated memory is still 208.7 MB. Free memory was 148.0 MB in the beginning and 139.4 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2285.95 ms. Allocated memory was 208.7 MB in the beginning and 283.1 MB in the end (delta: 74.4 MB). Free memory was 139.4 MB in the beginning and 226.7 MB in the end (delta: -87.3 MB). Peak memory consumption was 146.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36771.72 ms. Allocated memory was 283.1 MB in the beginning and 865.6 MB in the end (delta: 582.5 MB). Free memory was 226.7 MB in the beginning and 715.6 MB in the end (delta: -488.9 MB). Peak memory consumption was 93.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 480 locations, 16 error locations. SAFE Result, 36.6s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1607 SDtfs, 37899 SDslu, 1734 SDs, 0 SdLazy, 11315 SolverSat, 10523 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 642 SyntacticMatches, 308 SemanticMatches, 490 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 102 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 3598126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...