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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:36:15,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:36:15,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:36:15,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:36:15,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:36:15,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:36:15,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:36:15,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:36:15,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:36:15,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:36:15,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:36:15,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:36:15,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:36:15,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:36:15,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:36:15,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:36:15,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:36:15,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:36:15,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:36:15,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:36:15,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:36:15,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:36:15,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:36:15,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:36:15,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:36:15,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:36:15,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:36:15,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:36:15,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:36:15,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:36:15,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:36:15,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:36:15,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:36:15,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:36:15,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:36:15,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:36:15,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:36:15,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:36:15,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:36:15,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:36:15,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:36:15,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:36:15,412 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:36:15,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:36:15,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:36:15,413 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:36:15,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:36:15,414 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:36:15,414 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:36:15,414 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:36:15,414 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:36:15,414 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:36:15,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:36:15,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:36:15,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:36:15,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:36:15,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:36:15,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:36:15,417 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:36:15,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:36:15,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:36:15,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:36:15,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:36:15,418 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:36:15,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:36:15,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:36:15,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:36:15,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:36:15,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:36:15,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:36:15,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:36:15,471 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:36:15,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:36:15,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85d05693/9340dd8ee88940e2bc854fc8af9d4fd1/FLAG664dd46be [2019-09-10 06:36:16,294 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:36:16,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:36:16,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85d05693/9340dd8ee88940e2bc854fc8af9d4fd1/FLAG664dd46be [2019-09-10 06:36:16,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85d05693/9340dd8ee88940e2bc854fc8af9d4fd1 [2019-09-10 06:36:16,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:36:16,424 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:36:16,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:16,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:36:16,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:36:16,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:16" (1/1) ... [2019-09-10 06:36:16,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4629a724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:16, skipping insertion in model container [2019-09-10 06:36:16,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:36:16" (1/1) ... [2019-09-10 06:36:16,441 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:36:16,589 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:36:17,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:17,737 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:36:18,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:36:18,210 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:36:18,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18 WrapperNode [2019-09-10 06:36:18,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:36:18,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:36:18,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:36:18,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:36:18,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... [2019-09-10 06:36:18,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:36:18,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:36:18,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:36:18,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:36:18,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:36:18,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:36:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:36:18,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:36:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:36:18,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:36:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:36:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:36:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:36:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:36:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:36:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:36:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:36:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:36:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:36:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:36:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:36:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:36:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:36:22,077 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:36:22,079 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:36:22,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:22 BoogieIcfgContainer [2019-09-10 06:36:22,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:36:22,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:36:22,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:36:22,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:36:22,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:36:16" (1/3) ... [2019-09-10 06:36:22,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a68bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:22, skipping insertion in model container [2019-09-10 06:36:22,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:36:18" (2/3) ... [2019-09-10 06:36:22,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132a68bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:36:22, skipping insertion in model container [2019-09-10 06:36:22,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:36:22" (3/3) ... [2019-09-10 06:36:22,098 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-09-10 06:36:22,111 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:36:22,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 06:36:22,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 06:36:22,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:36:22,194 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:36:22,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:36:22,195 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:36:22,195 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:36:22,195 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:36:22,195 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:36:22,196 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:36:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-09-10 06:36:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:36:22,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:22,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:22,277 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-09-10 06:36:22,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:22,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:22,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:22,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:22,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:22,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:22,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:22,990 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-09-10 06:36:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:25,117 INFO L93 Difference]: Finished difference Result 1614 states and 2703 transitions. [2019-09-10 06:36:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:25,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 06:36:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:25,144 INFO L225 Difference]: With dead ends: 1614 [2019-09-10 06:36:25,144 INFO L226 Difference]: Without dead ends: 1602 [2019-09-10 06:36:25,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:36:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-09-10 06:36:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1596. [2019-09-10 06:36:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-09-10 06:36:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2078 transitions. [2019-09-10 06:36:25,272 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2078 transitions. Word has length 56 [2019-09-10 06:36:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:25,273 INFO L475 AbstractCegarLoop]: Abstraction has 1596 states and 2078 transitions. [2019-09-10 06:36:25,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2078 transitions. [2019-09-10 06:36:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:25,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:25,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:25,279 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-09-10 06:36:25,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:25,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:25,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:25,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:25,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:25,498 INFO L87 Difference]: Start difference. First operand 1596 states and 2078 transitions. Second operand 6 states. [2019-09-10 06:36:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:26,827 INFO L93 Difference]: Finished difference Result 2611 states and 3440 transitions. [2019-09-10 06:36:26,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:26,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:36:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:26,841 INFO L225 Difference]: With dead ends: 2611 [2019-09-10 06:36:26,841 INFO L226 Difference]: Without dead ends: 2611 [2019-09-10 06:36:26,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:36:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2019-09-10 06:36:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2588. [2019-09-10 06:36:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-09-10 06:36:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3422 transitions. [2019-09-10 06:36:26,911 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3422 transitions. Word has length 57 [2019-09-10 06:36:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:26,911 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3422 transitions. [2019-09-10 06:36:26,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3422 transitions. [2019-09-10 06:36:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 06:36:26,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:26,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:26,917 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:26,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-09-10 06:36:26,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:26,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:27,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:27,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:27,061 INFO L87 Difference]: Start difference. First operand 2588 states and 3422 transitions. Second operand 6 states. [2019-09-10 06:36:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:28,246 INFO L93 Difference]: Finished difference Result 4460 states and 5938 transitions. [2019-09-10 06:36:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:28,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 06:36:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:28,273 INFO L225 Difference]: With dead ends: 4460 [2019-09-10 06:36:28,281 INFO L226 Difference]: Without dead ends: 4460 [2019-09-10 06:36:28,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:36:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-09-10 06:36:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4444. [2019-09-10 06:36:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-10 06:36:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5927 transitions. [2019-09-10 06:36:28,390 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5927 transitions. Word has length 57 [2019-09-10 06:36:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:28,393 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5927 transitions. [2019-09-10 06:36:28,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5927 transitions. [2019-09-10 06:36:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:28,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:28,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:28,398 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-09-10 06:36:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:28,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:28,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:28,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:28,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:28,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:28,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:36:28,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:28,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:36:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:36:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:28,713 INFO L87 Difference]: Start difference. First operand 4444 states and 5927 transitions. Second operand 9 states. [2019-09-10 06:36:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:31,929 INFO L93 Difference]: Finished difference Result 8492 states and 12034 transitions. [2019-09-10 06:36:31,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:36:31,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:36:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:31,964 INFO L225 Difference]: With dead ends: 8492 [2019-09-10 06:36:31,964 INFO L226 Difference]: Without dead ends: 8492 [2019-09-10 06:36:31,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:36:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-09-10 06:36:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 4444. [2019-09-10 06:36:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-10 06:36:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5926 transitions. [2019-09-10 06:36:32,105 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5926 transitions. Word has length 59 [2019-09-10 06:36:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:32,106 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5926 transitions. [2019-09-10 06:36:32,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5926 transitions. [2019-09-10 06:36:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:32,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:32,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:32,111 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-09-10 06:36:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:32,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:36:32,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:32,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:36:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:36:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:36:32,351 INFO L87 Difference]: Start difference. First operand 4444 states and 5926 transitions. Second operand 9 states. [2019-09-10 06:36:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:36,093 INFO L93 Difference]: Finished difference Result 11461 states and 16045 transitions. [2019-09-10 06:36:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:36:36,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-10 06:36:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:36,139 INFO L225 Difference]: With dead ends: 11461 [2019-09-10 06:36:36,139 INFO L226 Difference]: Without dead ends: 11461 [2019-09-10 06:36:36,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:36:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-09-10 06:36:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4444. [2019-09-10 06:36:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-10 06:36:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5925 transitions. [2019-09-10 06:36:36,287 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5925 transitions. Word has length 59 [2019-09-10 06:36:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:36,287 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5925 transitions. [2019-09-10 06:36:36,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:36:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5925 transitions. [2019-09-10 06:36:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:36:36,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:36,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:36,292 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-09-10 06:36:36,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:36,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:36,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:36:36,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:36,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:36:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:36:36,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:36:36,461 INFO L87 Difference]: Start difference. First operand 4444 states and 5925 transitions. Second operand 8 states. [2019-09-10 06:36:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:38,895 INFO L93 Difference]: Finished difference Result 8259 states and 11777 transitions. [2019-09-10 06:36:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:36:38,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-10 06:36:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:38,914 INFO L225 Difference]: With dead ends: 8259 [2019-09-10 06:36:38,914 INFO L226 Difference]: Without dead ends: 8259 [2019-09-10 06:36:38,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:36:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2019-09-10 06:36:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 4444. [2019-09-10 06:36:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-09-10 06:36:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 5924 transitions. [2019-09-10 06:36:39,010 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 5924 transitions. Word has length 59 [2019-09-10 06:36:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:39,010 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 5924 transitions. [2019-09-10 06:36:39,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:36:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 5924 transitions. [2019-09-10 06:36:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:39,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:39,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:39,015 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:39,015 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-09-10 06:36:39,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:39,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:39,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:39,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:39,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:39,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,118 INFO L87 Difference]: Start difference. First operand 4444 states and 5924 transitions. Second operand 3 states. [2019-09-10 06:36:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:39,277 INFO L93 Difference]: Finished difference Result 6004 states and 7867 transitions. [2019-09-10 06:36:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:39,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:39,291 INFO L225 Difference]: With dead ends: 6004 [2019-09-10 06:36:39,291 INFO L226 Difference]: Without dead ends: 6004 [2019-09-10 06:36:39,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2019-09-10 06:36:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5998. [2019-09-10 06:36:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5998 states. [2019-09-10 06:36:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 7863 transitions. [2019-09-10 06:36:39,377 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 7863 transitions. Word has length 60 [2019-09-10 06:36:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:39,378 INFO L475 AbstractCegarLoop]: Abstraction has 5998 states and 7863 transitions. [2019-09-10 06:36:39,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 7863 transitions. [2019-09-10 06:36:39,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:39,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:39,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:39,384 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:39,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-09-10 06:36:39,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:39,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:39,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:39,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:39,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:39,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:39,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,512 INFO L87 Difference]: Start difference. First operand 5998 states and 7863 transitions. Second operand 3 states. [2019-09-10 06:36:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:39,596 INFO L93 Difference]: Finished difference Result 7094 states and 9581 transitions. [2019-09-10 06:36:39,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:39,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:39,616 INFO L225 Difference]: With dead ends: 7094 [2019-09-10 06:36:39,616 INFO L226 Difference]: Without dead ends: 7094 [2019-09-10 06:36:39,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2019-09-10 06:36:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 6490. [2019-09-10 06:36:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-09-10 06:36:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 8682 transitions. [2019-09-10 06:36:39,721 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 8682 transitions. Word has length 60 [2019-09-10 06:36:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:39,721 INFO L475 AbstractCegarLoop]: Abstraction has 6490 states and 8682 transitions. [2019-09-10 06:36:39,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 8682 transitions. [2019-09-10 06:36:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:36:39,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:39,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:39,727 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-09-10 06:36:39,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:39,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:39,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:39,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:39,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:39,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:39,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,861 INFO L87 Difference]: Start difference. First operand 6490 states and 8682 transitions. Second operand 3 states. [2019-09-10 06:36:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:39,948 INFO L93 Difference]: Finished difference Result 8405 states and 11492 transitions. [2019-09-10 06:36:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:39,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:36:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:39,964 INFO L225 Difference]: With dead ends: 8405 [2019-09-10 06:36:39,964 INFO L226 Difference]: Without dead ends: 8405 [2019-09-10 06:36:39,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8405 states. [2019-09-10 06:36:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8405 to 7489. [2019-09-10 06:36:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7489 states. [2019-09-10 06:36:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7489 states to 7489 states and 10153 transitions. [2019-09-10 06:36:40,080 INFO L78 Accepts]: Start accepts. Automaton has 7489 states and 10153 transitions. Word has length 60 [2019-09-10 06:36:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:40,080 INFO L475 AbstractCegarLoop]: Abstraction has 7489 states and 10153 transitions. [2019-09-10 06:36:40,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7489 states and 10153 transitions. [2019-09-10 06:36:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:40,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:40,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:40,086 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-09-10 06:36:40,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:40,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:40,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:40,284 INFO L87 Difference]: Start difference. First operand 7489 states and 10153 transitions. Second operand 3 states. [2019-09-10 06:36:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:40,438 INFO L93 Difference]: Finished difference Result 9967 states and 13996 transitions. [2019-09-10 06:36:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:40,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:40,460 INFO L225 Difference]: With dead ends: 9967 [2019-09-10 06:36:40,460 INFO L226 Difference]: Without dead ends: 9967 [2019-09-10 06:36:40,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-09-10 06:36:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 8100. [2019-09-10 06:36:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8100 states. [2019-09-10 06:36:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11278 transitions. [2019-09-10 06:36:40,583 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11278 transitions. Word has length 61 [2019-09-10 06:36:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:40,583 INFO L475 AbstractCegarLoop]: Abstraction has 8100 states and 11278 transitions. [2019-09-10 06:36:40,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11278 transitions. [2019-09-10 06:36:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:40,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:40,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:40,587 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-09-10 06:36:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:40,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:41,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:41,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:36:41,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:41,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:36:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:36:41,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:36:41,162 INFO L87 Difference]: Start difference. First operand 8100 states and 11278 transitions. Second operand 12 states. [2019-09-10 06:36:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:42,915 INFO L93 Difference]: Finished difference Result 17815 states and 25434 transitions. [2019-09-10 06:36:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:36:42,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-10 06:36:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:42,953 INFO L225 Difference]: With dead ends: 17815 [2019-09-10 06:36:42,953 INFO L226 Difference]: Without dead ends: 17815 [2019-09-10 06:36:42,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:36:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17815 states. [2019-09-10 06:36:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17815 to 8099. [2019-09-10 06:36:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8099 states. [2019-09-10 06:36:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8099 states to 8099 states and 11276 transitions. [2019-09-10 06:36:43,258 INFO L78 Accepts]: Start accepts. Automaton has 8099 states and 11276 transitions. Word has length 61 [2019-09-10 06:36:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:43,258 INFO L475 AbstractCegarLoop]: Abstraction has 8099 states and 11276 transitions. [2019-09-10 06:36:43,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:36:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 8099 states and 11276 transitions. [2019-09-10 06:36:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:43,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:43,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:43,263 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash -169233154, now seen corresponding path program 1 times [2019-09-10 06:36:43,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:43,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:43,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:43,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:43,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:43,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:43,359 INFO L87 Difference]: Start difference. First operand 8099 states and 11276 transitions. Second operand 3 states. [2019-09-10 06:36:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:43,478 INFO L93 Difference]: Finished difference Result 12086 states and 17269 transitions. [2019-09-10 06:36:43,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:43,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:43,504 INFO L225 Difference]: With dead ends: 12086 [2019-09-10 06:36:43,504 INFO L226 Difference]: Without dead ends: 12086 [2019-09-10 06:36:43,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12086 states. [2019-09-10 06:36:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12086 to 9573. [2019-09-10 06:36:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9573 states. [2019-09-10 06:36:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9573 states to 9573 states and 13606 transitions. [2019-09-10 06:36:43,659 INFO L78 Accepts]: Start accepts. Automaton has 9573 states and 13606 transitions. Word has length 61 [2019-09-10 06:36:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:43,660 INFO L475 AbstractCegarLoop]: Abstraction has 9573 states and 13606 transitions. [2019-09-10 06:36:43,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 9573 states and 13606 transitions. [2019-09-10 06:36:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 06:36:43,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:43,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:43,664 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 58994233, now seen corresponding path program 1 times [2019-09-10 06:36:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:43,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:43,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:43,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:43,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:43,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:43,751 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:43,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:43,753 INFO L87 Difference]: Start difference. First operand 9573 states and 13606 transitions. Second operand 3 states. [2019-09-10 06:36:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:43,883 INFO L93 Difference]: Finished difference Result 10943 states and 15651 transitions. [2019-09-10 06:36:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:43,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-10 06:36:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:43,903 INFO L225 Difference]: With dead ends: 10943 [2019-09-10 06:36:43,903 INFO L226 Difference]: Without dead ends: 10943 [2019-09-10 06:36:43,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:43,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10943 states. [2019-09-10 06:36:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10943 to 8868. [2019-09-10 06:36:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8868 states. [2019-09-10 06:36:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 12687 transitions. [2019-09-10 06:36:44,018 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 12687 transitions. Word has length 61 [2019-09-10 06:36:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:44,019 INFO L475 AbstractCegarLoop]: Abstraction has 8868 states and 12687 transitions. [2019-09-10 06:36:44,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 12687 transitions. [2019-09-10 06:36:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:44,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:44,022 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:44,022 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -244084559, now seen corresponding path program 1 times [2019-09-10 06:36:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:44,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:44,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:44,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:44,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 06:36:44,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:44,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:36:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:36:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:36:44,695 INFO L87 Difference]: Start difference. First operand 8868 states and 12687 transitions. Second operand 13 states. [2019-09-10 06:36:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:47,063 INFO L93 Difference]: Finished difference Result 15225 states and 21836 transitions. [2019-09-10 06:36:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:36:47,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-10 06:36:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:47,084 INFO L225 Difference]: With dead ends: 15225 [2019-09-10 06:36:47,085 INFO L226 Difference]: Without dead ends: 15225 [2019-09-10 06:36:47,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:36:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-09-10 06:36:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 8868. [2019-09-10 06:36:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8868 states. [2019-09-10 06:36:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8868 states to 8868 states and 12686 transitions. [2019-09-10 06:36:47,263 INFO L78 Accepts]: Start accepts. Automaton has 8868 states and 12686 transitions. Word has length 62 [2019-09-10 06:36:47,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:47,263 INFO L475 AbstractCegarLoop]: Abstraction has 8868 states and 12686 transitions. [2019-09-10 06:36:47,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:36:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8868 states and 12686 transitions. [2019-09-10 06:36:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:36:47,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:47,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:47,270 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 271982167, now seen corresponding path program 1 times [2019-09-10 06:36:47,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:47,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:47,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:47,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:47,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:36:47,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:47,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:36:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:36:47,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:36:47,884 INFO L87 Difference]: Start difference. First operand 8868 states and 12686 transitions. Second operand 14 states. [2019-09-10 06:36:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:50,969 INFO L93 Difference]: Finished difference Result 20137 states and 28893 transitions. [2019-09-10 06:36:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:36:50,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-09-10 06:36:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:51,003 INFO L225 Difference]: With dead ends: 20137 [2019-09-10 06:36:51,003 INFO L226 Difference]: Without dead ends: 20137 [2019-09-10 06:36:51,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:36:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20137 states. [2019-09-10 06:36:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20137 to 8804. [2019-09-10 06:36:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8804 states. [2019-09-10 06:36:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8804 states to 8804 states and 12607 transitions. [2019-09-10 06:36:51,227 INFO L78 Accepts]: Start accepts. Automaton has 8804 states and 12607 transitions. Word has length 62 [2019-09-10 06:36:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:51,227 INFO L475 AbstractCegarLoop]: Abstraction has 8804 states and 12607 transitions. [2019-09-10 06:36:51,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:36:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 8804 states and 12607 transitions. [2019-09-10 06:36:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:36:51,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:51,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:51,231 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2056344142, now seen corresponding path program 1 times [2019-09-10 06:36:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:51,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:36:51,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:52,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:36:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:36:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:36:52,002 INFO L87 Difference]: Start difference. First operand 8804 states and 12607 transitions. Second operand 14 states. [2019-09-10 06:36:52,495 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-10 06:36:52,865 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-09-10 06:36:53,106 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-10 06:36:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:55,036 INFO L93 Difference]: Finished difference Result 20383 states and 29357 transitions. [2019-09-10 06:36:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:36:55,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-09-10 06:36:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:55,057 INFO L225 Difference]: With dead ends: 20383 [2019-09-10 06:36:55,057 INFO L226 Difference]: Without dead ends: 20383 [2019-09-10 06:36:55,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-10 06:36:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-09-10 06:36:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 8800. [2019-09-10 06:36:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8800 states. [2019-09-10 06:36:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8800 states to 8800 states and 12603 transitions. [2019-09-10 06:36:55,238 INFO L78 Accepts]: Start accepts. Automaton has 8800 states and 12603 transitions. Word has length 63 [2019-09-10 06:36:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:55,238 INFO L475 AbstractCegarLoop]: Abstraction has 8800 states and 12603 transitions. [2019-09-10 06:36:55,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:36:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8800 states and 12603 transitions. [2019-09-10 06:36:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 06:36:55,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:55,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:55,241 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1004192523, now seen corresponding path program 1 times [2019-09-10 06:36:55,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:55,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:55,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:55,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:55,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:55,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:55,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:36:55,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:55,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:36:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:36:55,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:36:55,960 INFO L87 Difference]: Start difference. First operand 8800 states and 12603 transitions. Second operand 16 states. [2019-09-10 06:36:57,039 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-10 06:36:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:58,359 INFO L93 Difference]: Finished difference Result 11052 states and 15767 transitions. [2019-09-10 06:36:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 06:36:58,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-09-10 06:36:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:58,429 INFO L225 Difference]: With dead ends: 11052 [2019-09-10 06:36:58,429 INFO L226 Difference]: Without dead ends: 11052 [2019-09-10 06:36:58,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:36:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11052 states. [2019-09-10 06:36:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11052 to 8755. [2019-09-10 06:36:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-09-10 06:36:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 12543 transitions. [2019-09-10 06:36:58,530 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 12543 transitions. Word has length 63 [2019-09-10 06:36:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:58,531 INFO L475 AbstractCegarLoop]: Abstraction has 8755 states and 12543 transitions. [2019-09-10 06:36:58,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:36:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 12543 transitions. [2019-09-10 06:36:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:36:58,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:58,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:58,535 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2123353110, now seen corresponding path program 1 times [2019-09-10 06:36:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:58,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:58,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:58,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:58,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:58,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:58,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:58,749 INFO L87 Difference]: Start difference. First operand 8755 states and 12543 transitions. Second operand 6 states. [2019-09-10 06:36:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:59,005 INFO L93 Difference]: Finished difference Result 30233 states and 42549 transitions. [2019-09-10 06:36:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 06:36:59,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:36:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:59,041 INFO L225 Difference]: With dead ends: 30233 [2019-09-10 06:36:59,041 INFO L226 Difference]: Without dead ends: 30233 [2019-09-10 06:36:59,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:36:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30233 states. [2019-09-10 06:36:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30233 to 26561. [2019-09-10 06:36:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26561 states. [2019-09-10 06:36:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26561 states to 26561 states and 37422 transitions. [2019-09-10 06:36:59,367 INFO L78 Accepts]: Start accepts. Automaton has 26561 states and 37422 transitions. Word has length 70 [2019-09-10 06:36:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:59,368 INFO L475 AbstractCegarLoop]: Abstraction has 26561 states and 37422 transitions. [2019-09-10 06:36:59,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:36:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 26561 states and 37422 transitions. [2019-09-10 06:36:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:36:59,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:59,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:59,372 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1078555367, now seen corresponding path program 1 times [2019-09-10 06:36:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:59,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:59,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:36:59,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:59,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:36:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:36:59,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:59,482 INFO L87 Difference]: Start difference. First operand 26561 states and 37422 transitions. Second operand 5 states. [2019-09-10 06:36:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:59,612 INFO L93 Difference]: Finished difference Result 24729 states and 34772 transitions. [2019-09-10 06:36:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:36:59,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:36:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:36:59,633 INFO L225 Difference]: With dead ends: 24729 [2019-09-10 06:36:59,634 INFO L226 Difference]: Without dead ends: 24729 [2019-09-10 06:36:59,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:36:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24729 states. [2019-09-10 06:36:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24729 to 24725. [2019-09-10 06:36:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24725 states. [2019-09-10 06:36:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24725 states to 24725 states and 34770 transitions. [2019-09-10 06:36:59,838 INFO L78 Accepts]: Start accepts. Automaton has 24725 states and 34770 transitions. Word has length 71 [2019-09-10 06:36:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:59,838 INFO L475 AbstractCegarLoop]: Abstraction has 24725 states and 34770 transitions. [2019-09-10 06:36:59,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24725 states and 34770 transitions. [2019-09-10 06:36:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:36:59,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:59,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:36:59,843 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash 781945202, now seen corresponding path program 1 times [2019-09-10 06:36:59,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:59,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:59,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:59,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:36:59,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:59,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:36:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:36:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:36:59,969 INFO L87 Difference]: Start difference. First operand 24725 states and 34770 transitions. Second operand 6 states. [2019-09-10 06:37:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:00,321 INFO L93 Difference]: Finished difference Result 43423 states and 59913 transitions. [2019-09-10 06:37:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:00,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-10 06:37:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:00,377 INFO L225 Difference]: With dead ends: 43423 [2019-09-10 06:37:00,378 INFO L226 Difference]: Without dead ends: 43423 [2019-09-10 06:37:00,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43423 states. [2019-09-10 06:37:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43423 to 25541. [2019-09-10 06:37:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25541 states. [2019-09-10 06:37:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25541 states to 25541 states and 35404 transitions. [2019-09-10 06:37:00,841 INFO L78 Accepts]: Start accepts. Automaton has 25541 states and 35404 transitions. Word has length 73 [2019-09-10 06:37:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:00,841 INFO L475 AbstractCegarLoop]: Abstraction has 25541 states and 35404 transitions. [2019-09-10 06:37:00,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:37:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25541 states and 35404 transitions. [2019-09-10 06:37:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:37:00,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:00,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:00,845 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1414482205, now seen corresponding path program 1 times [2019-09-10 06:37:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:00,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:00,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:00,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:00,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:00,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:00,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:00,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:00,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:00,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:00,930 INFO L87 Difference]: Start difference. First operand 25541 states and 35404 transitions. Second operand 3 states. [2019-09-10 06:37:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:01,076 INFO L93 Difference]: Finished difference Result 43889 states and 60328 transitions. [2019-09-10 06:37:01,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:01,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:37:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:01,114 INFO L225 Difference]: With dead ends: 43889 [2019-09-10 06:37:01,115 INFO L226 Difference]: Without dead ends: 43889 [2019-09-10 06:37:01,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43889 states. [2019-09-10 06:37:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43889 to 43887. [2019-09-10 06:37:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43887 states. [2019-09-10 06:37:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43887 states to 43887 states and 60327 transitions. [2019-09-10 06:37:02,588 INFO L78 Accepts]: Start accepts. Automaton has 43887 states and 60327 transitions. Word has length 74 [2019-09-10 06:37:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:02,589 INFO L475 AbstractCegarLoop]: Abstraction has 43887 states and 60327 transitions. [2019-09-10 06:37:02,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43887 states and 60327 transitions. [2019-09-10 06:37:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:37:02,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:02,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:02,595 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1190739596, now seen corresponding path program 1 times [2019-09-10 06:37:02,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:02,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:02,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:02,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:02,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:02,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:02,695 INFO L87 Difference]: Start difference. First operand 43887 states and 60327 transitions. Second operand 5 states. [2019-09-10 06:37:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:03,619 INFO L93 Difference]: Finished difference Result 112689 states and 152518 transitions. [2019-09-10 06:37:03,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:03,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 06:37:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:03,740 INFO L225 Difference]: With dead ends: 112689 [2019-09-10 06:37:03,740 INFO L226 Difference]: Without dead ends: 112689 [2019-09-10 06:37:03,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112689 states. [2019-09-10 06:37:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112689 to 43454. [2019-09-10 06:37:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43454 states. [2019-09-10 06:37:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43454 states to 43454 states and 58919 transitions. [2019-09-10 06:37:04,798 INFO L78 Accepts]: Start accepts. Automaton has 43454 states and 58919 transitions. Word has length 76 [2019-09-10 06:37:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:04,799 INFO L475 AbstractCegarLoop]: Abstraction has 43454 states and 58919 transitions. [2019-09-10 06:37:04,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 43454 states and 58919 transitions. [2019-09-10 06:37:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:37:04,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:04,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:04,803 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2062750855, now seen corresponding path program 1 times [2019-09-10 06:37:04,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:04,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:04,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:04,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:04,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:04,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:04,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:04,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:04,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:04,881 INFO L87 Difference]: Start difference. First operand 43454 states and 58919 transitions. Second operand 3 states. [2019-09-10 06:37:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:05,006 INFO L93 Difference]: Finished difference Result 43456 states and 58038 transitions. [2019-09-10 06:37:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:05,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:37:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:05,054 INFO L225 Difference]: With dead ends: 43456 [2019-09-10 06:37:05,054 INFO L226 Difference]: Without dead ends: 43456 [2019-09-10 06:37:05,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43456 states. [2019-09-10 06:37:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43456 to 34476. [2019-09-10 06:37:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34476 states. [2019-09-10 06:37:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34476 states to 34476 states and 46147 transitions. [2019-09-10 06:37:05,565 INFO L78 Accepts]: Start accepts. Automaton has 34476 states and 46147 transitions. Word has length 77 [2019-09-10 06:37:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:05,566 INFO L475 AbstractCegarLoop]: Abstraction has 34476 states and 46147 transitions. [2019-09-10 06:37:05,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34476 states and 46147 transitions. [2019-09-10 06:37:05,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 06:37:05,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:05,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:05,572 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -667932309, now seen corresponding path program 1 times [2019-09-10 06:37:05,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:05,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:05,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:05,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:05,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:05,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:05,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:05,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:05,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:05,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:05,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:05,655 INFO L87 Difference]: Start difference. First operand 34476 states and 46147 transitions. Second operand 5 states. [2019-09-10 06:37:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:06,504 INFO L93 Difference]: Finished difference Result 109530 states and 144700 transitions. [2019-09-10 06:37:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:06,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 06:37:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:06,649 INFO L225 Difference]: With dead ends: 109530 [2019-09-10 06:37:06,649 INFO L226 Difference]: Without dead ends: 109530 [2019-09-10 06:37:06,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109530 states. [2019-09-10 06:37:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109530 to 58161. [2019-09-10 06:37:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58161 states. [2019-09-10 06:37:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58161 states to 58161 states and 77381 transitions. [2019-09-10 06:37:08,735 INFO L78 Accepts]: Start accepts. Automaton has 58161 states and 77381 transitions. Word has length 78 [2019-09-10 06:37:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:08,736 INFO L475 AbstractCegarLoop]: Abstraction has 58161 states and 77381 transitions. [2019-09-10 06:37:08,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58161 states and 77381 transitions. [2019-09-10 06:37:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:37:08,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:08,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:08,740 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1157971312, now seen corresponding path program 1 times [2019-09-10 06:37:08,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:08,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:08,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:08,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:08,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:08,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:08,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:08,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:08,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:08,829 INFO L87 Difference]: Start difference. First operand 58161 states and 77381 transitions. Second operand 5 states. [2019-09-10 06:37:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:09,698 INFO L93 Difference]: Finished difference Result 173493 states and 226186 transitions. [2019-09-10 06:37:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:09,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 06:37:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:09,880 INFO L225 Difference]: With dead ends: 173493 [2019-09-10 06:37:09,881 INFO L226 Difference]: Without dead ends: 173493 [2019-09-10 06:37:09,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173493 states. [2019-09-10 06:37:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173493 to 115443. [2019-09-10 06:37:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115443 states. [2019-09-10 06:37:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115443 states to 115443 states and 152489 transitions. [2019-09-10 06:37:13,882 INFO L78 Accepts]: Start accepts. Automaton has 115443 states and 152489 transitions. Word has length 81 [2019-09-10 06:37:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:13,882 INFO L475 AbstractCegarLoop]: Abstraction has 115443 states and 152489 transitions. [2019-09-10 06:37:13,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 115443 states and 152489 transitions. [2019-09-10 06:37:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 06:37:13,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:13,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:13,887 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2119187877, now seen corresponding path program 1 times [2019-09-10 06:37:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:13,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:13,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:13,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:13,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:13,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:13,962 INFO L87 Difference]: Start difference. First operand 115443 states and 152489 transitions. Second operand 3 states. [2019-09-10 06:37:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:14,439 INFO L93 Difference]: Finished difference Result 207065 states and 267502 transitions. [2019-09-10 06:37:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:14,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 06:37:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:14,680 INFO L225 Difference]: With dead ends: 207065 [2019-09-10 06:37:14,680 INFO L226 Difference]: Without dead ends: 207065 [2019-09-10 06:37:14,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207065 states. [2019-09-10 06:37:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207065 to 148681. [2019-09-10 06:37:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148681 states. [2019-09-10 06:37:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148681 states to 148681 states and 192781 transitions. [2019-09-10 06:37:16,832 INFO L78 Accepts]: Start accepts. Automaton has 148681 states and 192781 transitions. Word has length 83 [2019-09-10 06:37:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:16,833 INFO L475 AbstractCegarLoop]: Abstraction has 148681 states and 192781 transitions. [2019-09-10 06:37:16,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 148681 states and 192781 transitions. [2019-09-10 06:37:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 06:37:16,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:16,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:16,839 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1236526896, now seen corresponding path program 1 times [2019-09-10 06:37:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:16,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:16,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-09-10 06:37:16,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:16,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:16,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:16,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:16,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:16,922 INFO L87 Difference]: Start difference. First operand 148681 states and 192781 transitions. Second operand 3 states. [2019-09-10 06:37:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:18,014 INFO L93 Difference]: Finished difference Result 189603 states and 240272 transitions. [2019-09-10 06:37:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:18,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 06:37:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:18,218 INFO L225 Difference]: With dead ends: 189603 [2019-09-10 06:37:18,218 INFO L226 Difference]: Without dead ends: 189603 [2019-09-10 06:37:18,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189603 states. [2019-09-10 06:37:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189603 to 148713. [2019-09-10 06:37:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148713 states. [2019-09-10 06:37:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148713 states to 148713 states and 189807 transitions. [2019-09-10 06:37:22,913 INFO L78 Accepts]: Start accepts. Automaton has 148713 states and 189807 transitions. Word has length 86 [2019-09-10 06:37:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:22,913 INFO L475 AbstractCegarLoop]: Abstraction has 148713 states and 189807 transitions. [2019-09-10 06:37:22,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 148713 states and 189807 transitions. [2019-09-10 06:37:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:37:22,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:22,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:22,918 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1275937295, now seen corresponding path program 1 times [2019-09-10 06:37:22,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:22,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:22,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:22,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:22,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:22,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:22,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:22,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:22,996 INFO L87 Difference]: Start difference. First operand 148713 states and 189807 transitions. Second operand 3 states. [2019-09-10 06:37:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:23,374 INFO L93 Difference]: Finished difference Result 179361 states and 224738 transitions. [2019-09-10 06:37:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:23,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-10 06:37:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:23,544 INFO L225 Difference]: With dead ends: 179361 [2019-09-10 06:37:23,544 INFO L226 Difference]: Without dead ends: 179361 [2019-09-10 06:37:23,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179361 states. [2019-09-10 06:37:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179361 to 169809. [2019-09-10 06:37:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169809 states. [2019-09-10 06:37:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169809 states to 169809 states and 213469 transitions. [2019-09-10 06:37:25,483 INFO L78 Accepts]: Start accepts. Automaton has 169809 states and 213469 transitions. Word has length 89 [2019-09-10 06:37:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:25,484 INFO L475 AbstractCegarLoop]: Abstraction has 169809 states and 213469 transitions. [2019-09-10 06:37:25,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 169809 states and 213469 transitions. [2019-09-10 06:37:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:37:25,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:25,493 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:25,493 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -383116103, now seen corresponding path program 1 times [2019-09-10 06:37:25,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:25,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:25,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:25,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:25,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:25,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:25,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:37:25,671 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 06:37:25,673 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [168], [171], [172], [174], [177], [180], [201], [203], [205], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2252], [2257], [2262], [2264], [2283], [2285], [2304], [2634], [2638], [2641], [2644], [2647], [2655], [2657], [3711], [3725], [3727], [3731], [3734], [3737], [3740], [3744], [3896], [3943], [3946], [3949], [3953], [3956], [3959], [3963], [3965], [3968], [3972], [3975], [3984], [3986], [4283], [4286], [4289], [4293], [4296], [4300], [4304], [4318], [4320], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:37:25,716 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:37:25,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:37:25,951 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:37:26,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:37:26,378 INFO L272 AbstractInterpreter]: Visited 92 different actions 287 times. Merged at 28 different actions 178 times. Widened at 10 different actions 22 times. Performed 1597 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1597 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 6 different actions. Largest state had 386 variables. [2019-09-10 06:37:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:26,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:37:26,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:37:26,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:37:26,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:26,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:37:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:26,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 2023 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 06:37:26,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:37:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:27,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:37:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:37:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:27,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:37:27,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 06:37:27,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:37:27,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 06:37:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 06:37:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:37:27,500 INFO L87 Difference]: Start difference. First operand 169809 states and 213469 transitions. Second operand 13 states. [2019-09-10 06:37:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:33,310 INFO L93 Difference]: Finished difference Result 413092 states and 518789 transitions. [2019-09-10 06:37:33,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:37:33,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 06:37:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:34,220 INFO L225 Difference]: With dead ends: 413092 [2019-09-10 06:37:34,220 INFO L226 Difference]: Without dead ends: 413092 [2019-09-10 06:37:34,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=560, Invalid=1696, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 06:37:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413092 states. [2019-09-10 06:37:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413092 to 218707. [2019-09-10 06:37:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218707 states. [2019-09-10 06:37:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218707 states to 218707 states and 274677 transitions. [2019-09-10 06:37:43,396 INFO L78 Accepts]: Start accepts. Automaton has 218707 states and 274677 transitions. Word has length 97 [2019-09-10 06:37:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:43,396 INFO L475 AbstractCegarLoop]: Abstraction has 218707 states and 274677 transitions. [2019-09-10 06:37:43,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 06:37:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 218707 states and 274677 transitions. [2019-09-10 06:37:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:37:43,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:43,406 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:43,407 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:43,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2107665468, now seen corresponding path program 1 times [2019-09-10 06:37:43,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:43,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:43,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:43,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:43,502 INFO L87 Difference]: Start difference. First operand 218707 states and 274677 transitions. Second operand 3 states. [2019-09-10 06:37:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:44,034 INFO L93 Difference]: Finished difference Result 215142 states and 267743 transitions. [2019-09-10 06:37:44,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:44,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:37:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:44,363 INFO L225 Difference]: With dead ends: 215142 [2019-09-10 06:37:44,363 INFO L226 Difference]: Without dead ends: 215142 [2019-09-10 06:37:44,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215142 states. [2019-09-10 06:37:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215142 to 214948. [2019-09-10 06:37:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214948 states. [2019-09-10 06:37:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214948 states to 214948 states and 267550 transitions. [2019-09-10 06:37:48,466 INFO L78 Accepts]: Start accepts. Automaton has 214948 states and 267550 transitions. Word has length 98 [2019-09-10 06:37:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:48,467 INFO L475 AbstractCegarLoop]: Abstraction has 214948 states and 267550 transitions. [2019-09-10 06:37:48,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:37:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 214948 states and 267550 transitions. [2019-09-10 06:37:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:37:48,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:48,473 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:48,474 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1350911043, now seen corresponding path program 1 times [2019-09-10 06:37:48,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:48,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:37:48,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:48,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:37:48,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:48,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:37:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:37:48,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:37:48,560 INFO L87 Difference]: Start difference. First operand 214948 states and 267550 transitions. Second operand 5 states. [2019-09-10 06:37:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:49,828 INFO L93 Difference]: Finished difference Result 250722 states and 308321 transitions. [2019-09-10 06:37:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:37:49,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:37:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:50,106 INFO L225 Difference]: With dead ends: 250722 [2019-09-10 06:37:50,107 INFO L226 Difference]: Without dead ends: 250722 [2019-09-10 06:37:50,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:37:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250722 states. [2019-09-10 06:37:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250722 to 206433. [2019-09-10 06:37:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206433 states. [2019-09-10 06:37:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206433 states to 206433 states and 253553 transitions. [2019-09-10 06:37:57,747 INFO L78 Accepts]: Start accepts. Automaton has 206433 states and 253553 transitions. Word has length 99 [2019-09-10 06:37:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:37:57,747 INFO L475 AbstractCegarLoop]: Abstraction has 206433 states and 253553 transitions. [2019-09-10 06:37:57,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:37:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 206433 states and 253553 transitions. [2019-09-10 06:37:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:37:57,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:37:57,754 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:37:57,754 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:37:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:37:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1499550427, now seen corresponding path program 1 times [2019-09-10 06:37:57,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:37:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:37:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:37:57,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:37:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:37:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:37:57,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:37:57,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:37:57,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:37:57,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:37:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:37:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:57,846 INFO L87 Difference]: Start difference. First operand 206433 states and 253553 transitions. Second operand 3 states. [2019-09-10 06:37:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:37:58,276 INFO L93 Difference]: Finished difference Result 206289 states and 250743 transitions. [2019-09-10 06:37:58,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:37:58,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:37:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:37:58,495 INFO L225 Difference]: With dead ends: 206289 [2019-09-10 06:37:58,496 INFO L226 Difference]: Without dead ends: 206289 [2019-09-10 06:37:58,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:37:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206289 states. [2019-09-10 06:38:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206289 to 155117. [2019-09-10 06:38:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155117 states. [2019-09-10 06:38:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155117 states to 155117 states and 189411 transitions. [2019-09-10 06:38:04,172 INFO L78 Accepts]: Start accepts. Automaton has 155117 states and 189411 transitions. Word has length 101 [2019-09-10 06:38:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:04,172 INFO L475 AbstractCegarLoop]: Abstraction has 155117 states and 189411 transitions. [2019-09-10 06:38:04,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:38:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 155117 states and 189411 transitions. [2019-09-10 06:38:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:38:04,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:04,179 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:04,180 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash 786221547, now seen corresponding path program 1 times [2019-09-10 06:38:04,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:04,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:04,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:04,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:04,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:04,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:04,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:04,309 INFO L87 Difference]: Start difference. First operand 155117 states and 189411 transitions. Second operand 5 states. [2019-09-10 06:38:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:05,153 INFO L93 Difference]: Finished difference Result 230402 states and 280930 transitions. [2019-09-10 06:38:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:05,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:38:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:05,489 INFO L225 Difference]: With dead ends: 230402 [2019-09-10 06:38:05,489 INFO L226 Difference]: Without dead ends: 230402 [2019-09-10 06:38:05,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:38:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230402 states. [2019-09-10 06:38:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230402 to 188562. [2019-09-10 06:38:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188562 states. [2019-09-10 06:38:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188562 states to 188562 states and 229833 transitions. [2019-09-10 06:38:11,119 INFO L78 Accepts]: Start accepts. Automaton has 188562 states and 229833 transitions. Word has length 104 [2019-09-10 06:38:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:11,119 INFO L475 AbstractCegarLoop]: Abstraction has 188562 states and 229833 transitions. [2019-09-10 06:38:11,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 188562 states and 229833 transitions. [2019-09-10 06:38:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:38:11,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:11,127 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:11,127 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:11,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 260740551, now seen corresponding path program 1 times [2019-09-10 06:38:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:11,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:11,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:38:11,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:11,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:38:11,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:11,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:38:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:38:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:11,237 INFO L87 Difference]: Start difference. First operand 188562 states and 229833 transitions. Second operand 5 states. [2019-09-10 06:38:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:11,897 INFO L93 Difference]: Finished difference Result 251786 states and 306628 transitions. [2019-09-10 06:38:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:11,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 06:38:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:12,165 INFO L225 Difference]: With dead ends: 251786 [2019-09-10 06:38:12,165 INFO L226 Difference]: Without dead ends: 251786 [2019-09-10 06:38:12,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:38:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251786 states. [2019-09-10 06:38:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251786 to 218812. [2019-09-10 06:38:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218812 states. [2019-09-10 06:38:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218812 states to 218812 states and 266467 transitions. [2019-09-10 06:38:17,708 INFO L78 Accepts]: Start accepts. Automaton has 218812 states and 266467 transitions. Word has length 104 [2019-09-10 06:38:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:17,708 INFO L475 AbstractCegarLoop]: Abstraction has 218812 states and 266467 transitions. [2019-09-10 06:38:17,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:38:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 218812 states and 266467 transitions. [2019-09-10 06:38:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 06:38:17,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:17,719 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:17,719 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1962158497, now seen corresponding path program 1 times [2019-09-10 06:38:17,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:17,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:38:17,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:17,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:38:17,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:17,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:38:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:38:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:38:17,805 INFO L87 Difference]: Start difference. First operand 218812 states and 266467 transitions. Second operand 4 states. [2019-09-10 06:38:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:19,935 INFO L93 Difference]: Finished difference Result 414784 states and 504762 transitions. [2019-09-10 06:38:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:38:19,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-10 06:38:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:20,470 INFO L225 Difference]: With dead ends: 414784 [2019-09-10 06:38:20,470 INFO L226 Difference]: Without dead ends: 414784 [2019-09-10 06:38:20,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:38:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414784 states. [2019-09-10 06:38:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414784 to 243981. [2019-09-10 06:38:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243981 states. [2019-09-10 06:38:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243981 states to 243981 states and 297827 transitions. [2019-09-10 06:38:30,036 INFO L78 Accepts]: Start accepts. Automaton has 243981 states and 297827 transitions. Word has length 107 [2019-09-10 06:38:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:30,037 INFO L475 AbstractCegarLoop]: Abstraction has 243981 states and 297827 transitions. [2019-09-10 06:38:30,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:38:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 243981 states and 297827 transitions. [2019-09-10 06:38:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:38:30,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:30,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:30,050 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1420978006, now seen corresponding path program 1 times [2019-09-10 06:38:30,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:30,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:30,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:30,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:30,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:30,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:38:30,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:38:30,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:38:30,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:38:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:38:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:38:30,294 INFO L87 Difference]: Start difference. First operand 243981 states and 297827 transitions. Second operand 10 states. [2019-09-10 06:38:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:34,520 INFO L93 Difference]: Finished difference Result 659886 states and 798038 transitions. [2019-09-10 06:38:34,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 06:38:34,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-10 06:38:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:35,293 INFO L225 Difference]: With dead ends: 659886 [2019-09-10 06:38:35,293 INFO L226 Difference]: Without dead ends: 659886 [2019-09-10 06:38:35,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-10 06:38:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659886 states. [2019-09-10 06:38:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659886 to 323047. [2019-09-10 06:38:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323047 states. [2019-09-10 06:38:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323047 states to 323047 states and 393562 transitions. [2019-09-10 06:38:42,160 INFO L78 Accepts]: Start accepts. Automaton has 323047 states and 393562 transitions. Word has length 108 [2019-09-10 06:38:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:38:42,161 INFO L475 AbstractCegarLoop]: Abstraction has 323047 states and 393562 transitions. [2019-09-10 06:38:42,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:38:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 323047 states and 393562 transitions. [2019-09-10 06:38:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:38:42,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:38:42,177 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:38:42,177 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:38:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash -499235246, now seen corresponding path program 1 times [2019-09-10 06:38:42,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:38:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:38:42,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:38:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:42,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:42,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:38:42,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2019-09-10 06:38:42,426 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [168], [171], [172], [174], [177], [180], [183], [186], [191], [194], [203], [205], [380], [483], [486], [489], [493], [496], [499], [503], [505], [508], [511], [514], [519], [522], [525], [528], [532], [536], [969], [972], [975], [979], [982], [986], [989], [992], [995], [1003], [1005], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2240], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2283], [2285], [2288], [2291], [2294], [2302], [2306], [2309], [2312], [2315], [2323], [2325], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:38:42,436 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:38:42,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:38:42,542 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:38:43,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:38:43,134 INFO L272 AbstractInterpreter]: Visited 103 different actions 393 times. Merged at 39 different actions 264 times. Widened at 16 different actions 42 times. Performed 1889 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1889 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 9 different actions. Largest state had 387 variables. [2019-09-10 06:38:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:38:43,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:38:43,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:38:43,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:38:43,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:38:43,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 06:38:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:38:44,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 06:38:44,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:38:44,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:44,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:45,081 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:38:45,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:45,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:45,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:45,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:38:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:38:45,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 06:38:45,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2019-09-10 06:38:45,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 06:38:45,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 06:38:45,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 06:38:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-09-10 06:38:45,410 INFO L87 Difference]: Start difference. First operand 323047 states and 393562 transitions. Second operand 19 states. [2019-09-10 06:38:47,868 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-09-10 06:38:48,470 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-09-10 06:38:48,690 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-09-10 06:38:49,805 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:38:50,128 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 06:38:50,403 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:38:50,714 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 06:38:51,324 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 06:38:51,665 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 06:38:52,686 WARN L188 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 06:38:53,079 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 06:38:53,991 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 06:38:54,170 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 06:38:55,040 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 06:38:55,494 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 06:38:55,906 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 06:38:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:38:58,759 INFO L93 Difference]: Finished difference Result 1007340 states and 1205998 transitions. [2019-09-10 06:38:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 06:38:58,760 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2019-09-10 06:38:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:38:59,982 INFO L225 Difference]: With dead ends: 1007340 [2019-09-10 06:38:59,982 INFO L226 Difference]: Without dead ends: 1007340 [2019-09-10 06:38:59,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 194 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1129, Invalid=3427, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 06:39:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007340 states. [2019-09-10 06:39:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007340 to 422105. [2019-09-10 06:39:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422105 states. [2019-09-10 06:39:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422105 states to 422105 states and 512579 transitions. [2019-09-10 06:39:16,243 INFO L78 Accepts]: Start accepts. Automaton has 422105 states and 512579 transitions. Word has length 109 [2019-09-10 06:39:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:16,244 INFO L475 AbstractCegarLoop]: Abstraction has 422105 states and 512579 transitions. [2019-09-10 06:39:16,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 06:39:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 422105 states and 512579 transitions. [2019-09-10 06:39:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 06:39:16,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:16,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:39:16,258 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2079199686, now seen corresponding path program 1 times [2019-09-10 06:39:16,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:16,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:16,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:16,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 06:39:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:39:16,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:16,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:39:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:39:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:39:16,415 INFO L87 Difference]: Start difference. First operand 422105 states and 512579 transitions. Second operand 9 states. [2019-09-10 06:39:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:26,582 INFO L93 Difference]: Finished difference Result 733927 states and 887988 transitions. [2019-09-10 06:39:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:39:26,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-10 06:39:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:27,469 INFO L225 Difference]: With dead ends: 733927 [2019-09-10 06:39:27,470 INFO L226 Difference]: Without dead ends: 733927 [2019-09-10 06:39:27,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:39:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733927 states. [2019-09-10 06:39:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733927 to 422105. [2019-09-10 06:39:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422105 states. [2019-09-10 06:39:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422105 states to 422105 states and 512577 transitions. [2019-09-10 06:39:33,299 INFO L78 Accepts]: Start accepts. Automaton has 422105 states and 512577 transitions. Word has length 109 [2019-09-10 06:39:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:33,300 INFO L475 AbstractCegarLoop]: Abstraction has 422105 states and 512577 transitions. [2019-09-10 06:39:33,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:39:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 422105 states and 512577 transitions. [2019-09-10 06:39:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:39:33,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:33,313 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:39:33,313 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2040206367, now seen corresponding path program 1 times [2019-09-10 06:39:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:33,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:33,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:39:33,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:39:33,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:39:33,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:39:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:39:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:33,389 INFO L87 Difference]: Start difference. First operand 422105 states and 512577 transitions. Second operand 3 states. [2019-09-10 06:39:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:39:35,457 INFO L93 Difference]: Finished difference Result 436514 states and 528638 transitions. [2019-09-10 06:39:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:39:35,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:39:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:39:35,948 INFO L225 Difference]: With dead ends: 436514 [2019-09-10 06:39:35,948 INFO L226 Difference]: Without dead ends: 436514 [2019-09-10 06:39:35,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:39:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436514 states. [2019-09-10 06:39:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436514 to 435806. [2019-09-10 06:39:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435806 states. [2019-09-10 06:39:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435806 states to 435806 states and 527931 transitions. [2019-09-10 06:39:46,222 INFO L78 Accepts]: Start accepts. Automaton has 435806 states and 527931 transitions. Word has length 110 [2019-09-10 06:39:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:39:46,222 INFO L475 AbstractCegarLoop]: Abstraction has 435806 states and 527931 transitions. [2019-09-10 06:39:46,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:39:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 435806 states and 527931 transitions. [2019-09-10 06:39:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:39:46,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:39:46,235 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:39:46,235 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:39:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:46,235 INFO L82 PathProgramCache]: Analyzing trace with hash -675829432, now seen corresponding path program 1 times [2019-09-10 06:39:46,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:39:46,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:46,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:46,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:39:46,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:39:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:47,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:47,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:39:47,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-10 06:39:47,389 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [61], [64], [67], [70], [72], [76], [79], [82], [85], [89], [168], [171], [172], [174], [177], [180], [183], [186], [191], [194], [203], [205], [380], [483], [486], [489], [493], [496], [499], [503], [505], [508], [511], [514], [519], [522], [525], [528], [532], [536], [969], [972], [975], [979], [982], [986], [989], [992], [995], [1003], [1005], [2186], [2189], [2210], [2212], [2214], [2216], [2219], [2222], [2238], [2242], [2244], [2247], [2250], [2260], [2262], [2264], [2283], [2285], [2288], [2291], [2294], [2302], [2306], [2309], [2312], [2315], [2323], [2325], [4929], [4930], [4934], [4935], [4936] [2019-09-10 06:39:47,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:39:47,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:39:47,518 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:39:48,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:39:48,066 INFO L272 AbstractInterpreter]: Visited 104 different actions 463 times. Merged at 40 different actions 329 times. Widened at 15 different actions 52 times. Performed 2025 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2025 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 13 different actions. Largest state had 387 variables. [2019-09-10 06:39:48,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:39:48,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:39:48,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:39:48,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:39:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:39:48,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:39:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:39:48,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 2051 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 06:39:48,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:39:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:39:49,171 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:39:49,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:49,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:39:49,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 06:41:12,594 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-09-10 06:41:12,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:41:12,796 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1428) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:631) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-09-10 06:41:12,804 INFO L168 Benchmark]: Toolchain (without parser) took 296379.93 ms. Allocated memory was 140.0 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 83.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,805 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1786.34 ms. Allocated memory was 140.0 MB in the beginning and 228.6 MB in the end (delta: 88.6 MB). Free memory was 83.1 MB in the beginning and 129.4 MB in the end (delta: -46.3 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,806 INFO L168 Benchmark]: Boogie Preprocessor took 312.70 ms. Allocated memory is still 228.6 MB. Free memory was 129.4 MB in the beginning and 114.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,807 INFO L168 Benchmark]: RCFGBuilder took 3555.87 ms. Allocated memory was 228.6 MB in the beginning and 325.1 MB in the end (delta: 96.5 MB). Free memory was 114.4 MB in the beginning and 124.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,808 INFO L168 Benchmark]: TraceAbstraction took 290720.32 ms. Allocated memory was 325.1 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 124.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-09-10 06:41:12,821 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 140.0 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1786.34 ms. Allocated memory was 140.0 MB in the beginning and 228.6 MB in the end (delta: 88.6 MB). Free memory was 83.1 MB in the beginning and 129.4 MB in the end (delta: -46.3 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 312.70 ms. Allocated memory is still 228.6 MB. Free memory was 129.4 MB in the beginning and 114.4 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3555.87 ms. Allocated memory was 228.6 MB in the beginning and 325.1 MB in the end (delta: 96.5 MB). Free memory was 114.4 MB in the beginning and 124.1 MB in the end (delta: -9.7 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 290720.32 ms. Allocated memory was 325.1 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 124.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...