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.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:47:49,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:47:49,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:47:49,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:47:49,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:47:49,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:47:49,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:47:49,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:47:49,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:47:49,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:47:49,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:47:49,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:47:49,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:47:49,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:47:49,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:47:49,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:47:49,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:47:49,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:47:49,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:47:49,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:47:49,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:47:49,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:47:49,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:47:49,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:47:49,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:47:49,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:47:49,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:47:49,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:47:49,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:47:49,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:47:49,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:47:49,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:47:49,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:47:49,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:47:49,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:47:49,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:47:49,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:47:49,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:47:49,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:47:49,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:47:49,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:47:49,377 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 07:47:49,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:47:49,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:47:49,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:47:49,397 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:47:49,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:47:49,398 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:47:49,398 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:47:49,399 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:47:49,399 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:47:49,399 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:47:49,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:47:49,400 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:47:49,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:47:49,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:47:49,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:47:49,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:47:49,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:47:49,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:47:49,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:47:49,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:47:49,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:47:49,402 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:47:49,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:47:49,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:47:49,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:47:49,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:47:49,403 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:47:49,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:47:49,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:47:49,403 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:47:49,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:47:49,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:47:49,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:47:49,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:47:49,461 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:47:49,462 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:47:49,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4788bcb/df0ba24b49e34d78b5b227c41a55d983/FLAG37569e711 [2019-09-10 07:47:50,205 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:47:50,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:47:50,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4788bcb/df0ba24b49e34d78b5b227c41a55d983/FLAG37569e711 [2019-09-10 07:47:50,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b4788bcb/df0ba24b49e34d78b5b227c41a55d983 [2019-09-10 07:47:50,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:47:50,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:47:50,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:47:50,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:47:50,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:47:50,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:47:50" (1/1) ... [2019-09-10 07:47:50,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cc7843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:50, skipping insertion in model container [2019-09-10 07:47:50,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:47:50" (1/1) ... [2019-09-10 07:47:50,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:47:50,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:47:51,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:47:51,365 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:47:51,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:47:51,874 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:47:51,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51 WrapperNode [2019-09-10 07:47:51,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:47:51,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:47:51,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:47:51,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:47:51,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:51,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:51,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:51,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:51,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:52,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:52,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (1/1) ... [2019-09-10 07:47:52,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:47:52,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:47:52,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:47:52,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:47:52,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (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 07:47:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:47:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:47:52,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:47:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:47:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:47:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:47:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:47:52,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:47:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:47:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:47:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:47:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:47:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:47:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:47:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:47:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:47:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:47:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:47:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:47:54,387 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:47:54,387 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:47:54,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:47:54 BoogieIcfgContainer [2019-09-10 07:47:54,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:47:54,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:47:54,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:47:54,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:47:54,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:47:50" (1/3) ... [2019-09-10 07:47:54,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3710b7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:47:54, skipping insertion in model container [2019-09-10 07:47:54,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:47:51" (2/3) ... [2019-09-10 07:47:54,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3710b7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:47:54, skipping insertion in model container [2019-09-10 07:47:54,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:47:54" (3/3) ... [2019-09-10 07:47:54,398 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-10 07:47:54,408 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:47:54,418 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-10 07:47:54,436 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-10 07:47:54,464 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:47:54,465 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:47:54,465 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:47:54,465 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:47:54,465 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:47:54,465 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:47:54,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:47:54,466 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:47:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-09-10 07:47:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:47:54,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:54,522 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] [2019-09-10 07:47:54,525 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash -45640292, now seen corresponding path program 1 times [2019-09-10 07:47:54,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:54,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:54,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:54,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:55,197 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 07:47:55,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:55,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:47:55,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:55,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:47:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:47:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:47:55,230 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 6 states. [2019-09-10 07:47:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:56,017 INFO L93 Difference]: Finished difference Result 632 states and 1018 transitions. [2019-09-10 07:47:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:56,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-10 07:47:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:56,039 INFO L225 Difference]: With dead ends: 632 [2019-09-10 07:47:56,040 INFO L226 Difference]: Without dead ends: 620 [2019-09-10 07:47:56,042 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 07:47:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-10 07:47:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 575. [2019-09-10 07:47:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-10 07:47:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 729 transitions. [2019-09-10 07:47:56,137 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 729 transitions. Word has length 64 [2019-09-10 07:47:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:56,138 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 729 transitions. [2019-09-10 07:47:56,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:47:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 729 transitions. [2019-09-10 07:47:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:47:56,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:56,143 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] [2019-09-10 07:47:56,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1649351166, now seen corresponding path program 1 times [2019-09-10 07:47:56,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:56,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:56,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:56,302 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 07:47:56,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:56,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:56,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:56,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:56,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:56,310 INFO L87 Difference]: Start difference. First operand 575 states and 729 transitions. Second operand 5 states. [2019-09-10 07:47:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:56,642 INFO L93 Difference]: Finished difference Result 423 states and 535 transitions. [2019-09-10 07:47:56,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:56,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:47:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:56,646 INFO L225 Difference]: With dead ends: 423 [2019-09-10 07:47:56,646 INFO L226 Difference]: Without dead ends: 423 [2019-09-10 07:47:56,647 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 07:47:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-10 07:47:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-09-10 07:47:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-10 07:47:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 535 transitions. [2019-09-10 07:47:56,668 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 535 transitions. Word has length 64 [2019-09-10 07:47:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:56,668 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 535 transitions. [2019-09-10 07:47:56,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 535 transitions. [2019-09-10 07:47:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:47:56,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:56,672 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] [2019-09-10 07:47:56,672 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1630759173, now seen corresponding path program 1 times [2019-09-10 07:47:56,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:56,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:56,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:56,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:56,911 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 07:47:56,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:56,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:56,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:56,914 INFO L87 Difference]: Start difference. First operand 423 states and 535 transitions. Second operand 5 states. [2019-09-10 07:47:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:57,173 INFO L93 Difference]: Finished difference Result 374 states and 476 transitions. [2019-09-10 07:47:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:57,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-10 07:47:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:57,178 INFO L225 Difference]: With dead ends: 374 [2019-09-10 07:47:57,179 INFO L226 Difference]: Without dead ends: 374 [2019-09-10 07:47:57,179 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 07:47:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-10 07:47:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2019-09-10 07:47:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-10 07:47:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 476 transitions. [2019-09-10 07:47:57,192 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 476 transitions. Word has length 64 [2019-09-10 07:47:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:57,192 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 476 transitions. [2019-09-10 07:47:57,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 476 transitions. [2019-09-10 07:47:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:47:57,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:57,195 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] [2019-09-10 07:47:57,196 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1724870339, now seen corresponding path program 1 times [2019-09-10 07:47:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:57,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:57,293 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 07:47:57,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:57,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:47:57,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:57,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:47:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:47:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:47:57,295 INFO L87 Difference]: Start difference. First operand 374 states and 476 transitions. Second operand 5 states. [2019-09-10 07:47:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:57,519 INFO L93 Difference]: Finished difference Result 333 states and 423 transitions. [2019-09-10 07:47:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:47:57,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 07:47:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:57,521 INFO L225 Difference]: With dead ends: 333 [2019-09-10 07:47:57,522 INFO L226 Difference]: Without dead ends: 333 [2019-09-10 07:47:57,522 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 07:47:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-10 07:47:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-09-10 07:47:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:47:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 423 transitions. [2019-09-10 07:47:57,532 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 423 transitions. Word has length 66 [2019-09-10 07:47:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:57,533 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 423 transitions. [2019-09-10 07:47:57,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:47:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 423 transitions. [2019-09-10 07:47:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:47:57,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:57,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] [2019-09-10 07:47:57,535 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 726626472, now seen corresponding path program 1 times [2019-09-10 07:47:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:57,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:57,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:57,722 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 07:47:57,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:47:57,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:57,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:47:57,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:47:57,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:47:57,724 INFO L87 Difference]: Start difference. First operand 333 states and 423 transitions. Second operand 8 states. [2019-09-10 07:47:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:58,255 INFO L93 Difference]: Finished difference Result 533 states and 692 transitions. [2019-09-10 07:47:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:47:58,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-10 07:47:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:58,258 INFO L225 Difference]: With dead ends: 533 [2019-09-10 07:47:58,259 INFO L226 Difference]: Without dead ends: 533 [2019-09-10 07:47:58,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:47:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-10 07:47:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2019-09-10 07:47:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:47:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 422 transitions. [2019-09-10 07:47:58,269 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 422 transitions. Word has length 68 [2019-09-10 07:47:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:58,270 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 422 transitions. [2019-09-10 07:47:58,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:47:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 422 transitions. [2019-09-10 07:47:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:47:58,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:58,272 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] [2019-09-10 07:47:58,272 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461784, now seen corresponding path program 1 times [2019-09-10 07:47:58,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:58,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:58,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:58,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:58,427 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 07:47:58,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:58,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:58,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:58,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:58,429 INFO L87 Difference]: Start difference. First operand 333 states and 422 transitions. Second operand 9 states. [2019-09-10 07:47:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:47:59,527 INFO L93 Difference]: Finished difference Result 752 states and 1009 transitions. [2019-09-10 07:47:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:47:59,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:47:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:47:59,532 INFO L225 Difference]: With dead ends: 752 [2019-09-10 07:47:59,532 INFO L226 Difference]: Without dead ends: 752 [2019-09-10 07:47:59,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:47:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-10 07:47:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 333. [2019-09-10 07:47:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:47:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 421 transitions. [2019-09-10 07:47:59,544 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 421 transitions. Word has length 68 [2019-09-10 07:47:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:47:59,545 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 421 transitions. [2019-09-10 07:47:59,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:47:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 421 transitions. [2019-09-10 07:47:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:47:59,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:47:59,546 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] [2019-09-10 07:47:59,547 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:47:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:47:59,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1312203704, now seen corresponding path program 1 times [2019-09-10 07:47:59,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:47:59,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:59,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:47:59,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:47:59,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:47:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:47:59,780 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 07:47:59,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:47:59,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:47:59,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:47:59,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:47:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:47:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:47:59,785 INFO L87 Difference]: Start difference. First operand 333 states and 421 transitions. Second operand 9 states. [2019-09-10 07:48:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:00,828 INFO L93 Difference]: Finished difference Result 753 states and 1009 transitions. [2019-09-10 07:48:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:00,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-10 07:48:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:00,832 INFO L225 Difference]: With dead ends: 753 [2019-09-10 07:48:00,832 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 07:48:00,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 07:48:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-10 07:48:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 420 transitions. [2019-09-10 07:48:00,846 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 420 transitions. Word has length 68 [2019-09-10 07:48:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:00,847 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 420 transitions. [2019-09-10 07:48:00,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 420 transitions. [2019-09-10 07:48:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:48:00,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:00,848 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] [2019-09-10 07:48:00,849 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1888529039, now seen corresponding path program 1 times [2019-09-10 07:48:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:00,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:01,124 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 07:48:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:01,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:01,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:01,127 INFO L87 Difference]: Start difference. First operand 333 states and 420 transitions. Second operand 9 states. [2019-09-10 07:48:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:02,189 INFO L93 Difference]: Finished difference Result 740 states and 986 transitions. [2019-09-10 07:48:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:02,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-10 07:48:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:02,194 INFO L225 Difference]: With dead ends: 740 [2019-09-10 07:48:02,194 INFO L226 Difference]: Without dead ends: 740 [2019-09-10 07:48:02,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-10 07:48:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-10 07:48:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 419 transitions. [2019-09-10 07:48:02,208 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 419 transitions. Word has length 69 [2019-09-10 07:48:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:02,208 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 419 transitions. [2019-09-10 07:48:02,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 419 transitions. [2019-09-10 07:48:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:02,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:02,210 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 07:48:02,210 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash 251258957, now seen corresponding path program 1 times [2019-09-10 07:48:02,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:02,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:02,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:02,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:02,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:02,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:02,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:02,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:02,362 INFO L87 Difference]: Start difference. First operand 333 states and 419 transitions. Second operand 9 states. [2019-09-10 07:48:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:03,393 INFO L93 Difference]: Finished difference Result 753 states and 1007 transitions. [2019-09-10 07:48:03,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:03,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:03,397 INFO L225 Difference]: With dead ends: 753 [2019-09-10 07:48:03,398 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 07:48:03,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 07:48:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-10 07:48:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 418 transitions. [2019-09-10 07:48:03,440 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 418 transitions. Word has length 70 [2019-09-10 07:48:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:03,440 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 418 transitions. [2019-09-10 07:48:03,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 418 transitions. [2019-09-10 07:48:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:03,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:03,442 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 07:48:03,442 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash 120874925, now seen corresponding path program 1 times [2019-09-10 07:48:03,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:03,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:03,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:03,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:03,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:03,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:03,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:03,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:03,687 INFO L87 Difference]: Start difference. First operand 333 states and 418 transitions. Second operand 9 states. [2019-09-10 07:48:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:04,777 INFO L93 Difference]: Finished difference Result 740 states and 984 transitions. [2019-09-10 07:48:04,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:04,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:04,786 INFO L225 Difference]: With dead ends: 740 [2019-09-10 07:48:04,786 INFO L226 Difference]: Without dead ends: 740 [2019-09-10 07:48:04,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-10 07:48:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-10 07:48:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 417 transitions. [2019-09-10 07:48:04,799 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 417 transitions. Word has length 70 [2019-09-10 07:48:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:04,799 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 417 transitions. [2019-09-10 07:48:04,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 417 transitions. [2019-09-10 07:48:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:04,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:04,800 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 07:48:04,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:04,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1647730477, now seen corresponding path program 1 times [2019-09-10 07:48:04,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:04,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:04,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:04,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:04,947 INFO L87 Difference]: Start difference. First operand 333 states and 417 transitions. Second operand 9 states. [2019-09-10 07:48:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:05,946 INFO L93 Difference]: Finished difference Result 752 states and 1001 transitions. [2019-09-10 07:48:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:05,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:05,951 INFO L225 Difference]: With dead ends: 752 [2019-09-10 07:48:05,951 INFO L226 Difference]: Without dead ends: 752 [2019-09-10 07:48:05,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-10 07:48:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 333. [2019-09-10 07:48:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 416 transitions. [2019-09-10 07:48:05,962 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 416 transitions. Word has length 70 [2019-09-10 07:48:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:05,962 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 416 transitions. [2019-09-10 07:48:05,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 416 transitions. [2019-09-10 07:48:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:05,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:05,964 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 07:48:05,964 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1135659117, now seen corresponding path program 1 times [2019-09-10 07:48:05,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:05,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:06,160 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 07:48:06,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:06,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:06,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:06,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:06,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:06,163 INFO L87 Difference]: Start difference. First operand 333 states and 416 transitions. Second operand 9 states. [2019-09-10 07:48:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:07,182 INFO L93 Difference]: Finished difference Result 740 states and 981 transitions. [2019-09-10 07:48:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:07,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:07,187 INFO L225 Difference]: With dead ends: 740 [2019-09-10 07:48:07,188 INFO L226 Difference]: Without dead ends: 740 [2019-09-10 07:48:07,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-10 07:48:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-10 07:48:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 415 transitions. [2019-09-10 07:48:07,199 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 415 transitions. Word has length 70 [2019-09-10 07:48:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:07,200 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 415 transitions. [2019-09-10 07:48:07,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 415 transitions. [2019-09-10 07:48:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:07,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:07,201 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 07:48:07,202 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1963584653, now seen corresponding path program 1 times [2019-09-10 07:48:07,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:07,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:07,384 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 07:48:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:07,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:07,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:07,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:07,386 INFO L87 Difference]: Start difference. First operand 333 states and 415 transitions. Second operand 9 states. [2019-09-10 07:48:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:08,240 INFO L93 Difference]: Finished difference Result 740 states and 980 transitions. [2019-09-10 07:48:08,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:08,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:08,245 INFO L225 Difference]: With dead ends: 740 [2019-09-10 07:48:08,245 INFO L226 Difference]: Without dead ends: 740 [2019-09-10 07:48:08,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-10 07:48:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-10 07:48:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 414 transitions. [2019-09-10 07:48:08,256 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 414 transitions. Word has length 70 [2019-09-10 07:48:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:08,256 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 414 transitions. [2019-09-10 07:48:08,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2019-09-10 07:48:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:48:08,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:08,258 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 07:48:08,258 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -483426451, now seen corresponding path program 1 times [2019-09-10 07:48:08,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:08,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:08,403 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 07:48:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:08,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:08,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:08,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:08,405 INFO L87 Difference]: Start difference. First operand 333 states and 414 transitions. Second operand 9 states. [2019-09-10 07:48:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:09,402 INFO L93 Difference]: Finished difference Result 753 states and 1000 transitions. [2019-09-10 07:48:09,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:48:09,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-10 07:48:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:09,407 INFO L225 Difference]: With dead ends: 753 [2019-09-10 07:48:09,407 INFO L226 Difference]: Without dead ends: 753 [2019-09-10 07:48:09,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-10 07:48:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-10 07:48:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 07:48:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 413 transitions. [2019-09-10 07:48:09,418 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 413 transitions. Word has length 70 [2019-09-10 07:48:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:09,419 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 413 transitions. [2019-09-10 07:48:09,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 413 transitions. [2019-09-10 07:48:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:09,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:09,420 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 07:48:09,421 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 13599436, now seen corresponding path program 1 times [2019-09-10 07:48:09,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:09,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:09,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:10,307 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 07:48:10,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:10,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:48:10,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:10,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:48:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:48:10,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:48:10,309 INFO L87 Difference]: Start difference. First operand 333 states and 413 transitions. Second operand 16 states. [2019-09-10 07:48:10,965 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:48:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:12,679 INFO L93 Difference]: Finished difference Result 795 states and 1006 transitions. [2019-09-10 07:48:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:48:12,681 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-10 07:48:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:12,684 INFO L225 Difference]: With dead ends: 795 [2019-09-10 07:48:12,685 INFO L226 Difference]: Without dead ends: 795 [2019-09-10 07:48:12,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:48:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-09-10 07:48:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 348. [2019-09-10 07:48:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 07:48:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 433 transitions. [2019-09-10 07:48:12,696 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 433 transitions. Word has length 71 [2019-09-10 07:48:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 433 transitions. [2019-09-10 07:48:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:48:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 433 transitions. [2019-09-10 07:48:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:12,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:12,698 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 07:48:12,698 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1414423564, now seen corresponding path program 1 times [2019-09-10 07:48:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:12,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:12,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:13,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 07:48:13,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:13,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:48:13,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:13,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:48:13,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:48:13,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:48:13,492 INFO L87 Difference]: Start difference. First operand 348 states and 433 transitions. Second operand 17 states. [2019-09-10 07:48:14,072 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:48:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:15,428 INFO L93 Difference]: Finished difference Result 775 states and 1023 transitions. [2019-09-10 07:48:15,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:48:15,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-10 07:48:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:15,432 INFO L225 Difference]: With dead ends: 775 [2019-09-10 07:48:15,432 INFO L226 Difference]: Without dead ends: 775 [2019-09-10 07:48:15,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-10 07:48:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 336. [2019-09-10 07:48:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 07:48:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 417 transitions. [2019-09-10 07:48:15,444 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 417 transitions. Word has length 71 [2019-09-10 07:48:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:15,444 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 417 transitions. [2019-09-10 07:48:15,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:48:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 417 transitions. [2019-09-10 07:48:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:48:15,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:15,445 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 07:48:15,446 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1732820084, now seen corresponding path program 1 times [2019-09-10 07:48:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:15,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:15,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:15,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:16,034 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 07:48:16,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:16,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:48:16,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:16,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:48:16,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:48:16,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:48:16,035 INFO L87 Difference]: Start difference. First operand 336 states and 417 transitions. Second operand 14 states. [2019-09-10 07:48:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:17,791 INFO L93 Difference]: Finished difference Result 856 states and 1139 transitions. [2019-09-10 07:48:17,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:48:17,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-10 07:48:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:17,796 INFO L225 Difference]: With dead ends: 856 [2019-09-10 07:48:17,796 INFO L226 Difference]: Without dead ends: 856 [2019-09-10 07:48:17,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:48:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-10 07:48:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 317. [2019-09-10 07:48:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-10 07:48:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 395 transitions. [2019-09-10 07:48:17,808 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 395 transitions. Word has length 71 [2019-09-10 07:48:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:17,808 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 395 transitions. [2019-09-10 07:48:17,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:48:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 395 transitions. [2019-09-10 07:48:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:17,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:17,809 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] [2019-09-10 07:48:17,810 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:17,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1601198802, now seen corresponding path program 1 times [2019-09-10 07:48:17,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:17,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:17,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:19,055 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 07:48:19,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:19,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 07:48:19,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:19,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:48:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:48:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:48:19,056 INFO L87 Difference]: Start difference. First operand 317 states and 395 transitions. Second operand 20 states. [2019-09-10 07:48:19,203 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:48:19,945 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 07:48:20,168 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-10 07:48:20,455 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 07:48:20,685 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:48:20,895 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 07:48:21,980 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-10 07:48:22,590 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:48:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:23,190 INFO L93 Difference]: Finished difference Result 652 states and 812 transitions. [2019-09-10 07:48:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:48:23,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-10 07:48:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:23,193 INFO L225 Difference]: With dead ends: 652 [2019-09-10 07:48:23,193 INFO L226 Difference]: Without dead ends: 652 [2019-09-10 07:48:23,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:48:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-10 07:48:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 328. [2019-09-10 07:48:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-10 07:48:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 411 transitions. [2019-09-10 07:48:23,204 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 411 transitions. Word has length 72 [2019-09-10 07:48:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:23,205 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 411 transitions. [2019-09-10 07:48:23,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:48:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 411 transitions. [2019-09-10 07:48:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:23,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:23,206 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] [2019-09-10 07:48:23,207 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1134979118, now seen corresponding path program 1 times [2019-09-10 07:48:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:23,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:24,452 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 07:48:24,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:24,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:24,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:24,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:24,456 INFO L87 Difference]: Start difference. First operand 328 states and 411 transitions. Second operand 21 states. [2019-09-10 07:48:25,165 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:48:25,321 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:48:25,494 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 07:48:25,764 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-10 07:48:26,073 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-10 07:48:26,254 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:48:26,423 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 07:48:26,595 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 07:48:26,825 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:48:27,021 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:48:27,186 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:48:27,393 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:48:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:28,492 INFO L93 Difference]: Finished difference Result 623 states and 785 transitions. [2019-09-10 07:48:28,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:48:28,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-10 07:48:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:28,495 INFO L225 Difference]: With dead ends: 623 [2019-09-10 07:48:28,495 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 07:48:28,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:48:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 07:48:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 328. [2019-09-10 07:48:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-10 07:48:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2019-09-10 07:48:28,504 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 72 [2019-09-10 07:48:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:28,505 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2019-09-10 07:48:28,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2019-09-10 07:48:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:28,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:28,506 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] [2019-09-10 07:48:28,507 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash -325456334, now seen corresponding path program 1 times [2019-09-10 07:48:28,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:28,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:29,292 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 07:48:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:48:29,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:29,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:48:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:48:29,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:48:29,294 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand 17 states. [2019-09-10 07:48:29,923 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 07:48:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:30,971 INFO L93 Difference]: Finished difference Result 494 states and 630 transitions. [2019-09-10 07:48:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:48:30,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-09-10 07:48:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:30,974 INFO L225 Difference]: With dead ends: 494 [2019-09-10 07:48:30,974 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 07:48:30,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 07:48:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 307. [2019-09-10 07:48:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-10 07:48:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 383 transitions. [2019-09-10 07:48:30,982 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 383 transitions. Word has length 72 [2019-09-10 07:48:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:30,982 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 383 transitions. [2019-09-10 07:48:30,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:48:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 383 transitions. [2019-09-10 07:48:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:48:30,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:30,984 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] [2019-09-10 07:48:30,984 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:30,984 INFO L82 PathProgramCache]: Analyzing trace with hash -535876087, now seen corresponding path program 1 times [2019-09-10 07:48:30,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:30,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:30,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:30,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:31,603 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 07:48:31,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:31,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:48:31,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:31,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:48:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:48:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:48:31,605 INFO L87 Difference]: Start difference. First operand 307 states and 383 transitions. Second operand 16 states. [2019-09-10 07:48:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:33,355 INFO L93 Difference]: Finished difference Result 913 states and 1251 transitions. [2019-09-10 07:48:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:48:33,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-09-10 07:48:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:33,359 INFO L225 Difference]: With dead ends: 913 [2019-09-10 07:48:33,359 INFO L226 Difference]: Without dead ends: 913 [2019-09-10 07:48:33,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:33,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-10 07:48:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 290. [2019-09-10 07:48:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-10 07:48:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 362 transitions. [2019-09-10 07:48:33,369 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 362 transitions. Word has length 72 [2019-09-10 07:48:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:33,370 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 362 transitions. [2019-09-10 07:48:33,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:48:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2019-09-10 07:48:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:48:33,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:33,371 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 07:48:33,372 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1933470062, now seen corresponding path program 1 times [2019-09-10 07:48:33,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:33,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:33,687 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 07:48:33,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:33,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:48:33,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:33,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:48:33,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:48:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:48:33,689 INFO L87 Difference]: Start difference. First operand 290 states and 362 transitions. Second operand 11 states. [2019-09-10 07:48:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:34,311 INFO L93 Difference]: Finished difference Result 554 states and 731 transitions. [2019-09-10 07:48:34,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:48:34,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-10 07:48:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:34,315 INFO L225 Difference]: With dead ends: 554 [2019-09-10 07:48:34,315 INFO L226 Difference]: Without dead ends: 554 [2019-09-10 07:48:34,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:48:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-10 07:48:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 286. [2019-09-10 07:48:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-10 07:48:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 358 transitions. [2019-09-10 07:48:34,322 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 358 transitions. Word has length 73 [2019-09-10 07:48:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:34,322 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 358 transitions. [2019-09-10 07:48:34,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:48:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 358 transitions. [2019-09-10 07:48:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:48:34,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:34,323 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 07:48:34,324 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2086852327, now seen corresponding path program 1 times [2019-09-10 07:48:34,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:34,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:34,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:34,824 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 07:48:34,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:34,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:48:34,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:34,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:48:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:48:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:34,825 INFO L87 Difference]: Start difference. First operand 286 states and 358 transitions. Second operand 12 states. [2019-09-10 07:48:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:35,913 INFO L93 Difference]: Finished difference Result 1199 states and 1681 transitions. [2019-09-10 07:48:35,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:48:35,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 07:48:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:35,920 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:48:35,920 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:48:35,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:48:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:48:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 252. [2019-09-10 07:48:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-10 07:48:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 315 transitions. [2019-09-10 07:48:35,931 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 315 transitions. Word has length 73 [2019-09-10 07:48:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:35,931 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 315 transitions. [2019-09-10 07:48:35,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:48:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 315 transitions. [2019-09-10 07:48:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:48:35,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:35,933 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 07:48:35,933 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1799415509, now seen corresponding path program 1 times [2019-09-10 07:48:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:35,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:37,647 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 07:48:37,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:37,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:37,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:37,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:37,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:37,649 INFO L87 Difference]: Start difference. First operand 252 states and 315 transitions. Second operand 21 states. [2019-09-10 07:48:37,853 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:48:38,199 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:48:38,368 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:48:38,576 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 07:48:38,926 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:48:39,241 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:48:39,645 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 07:48:40,050 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:48:40,451 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 07:48:40,865 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:48:41,377 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-10 07:48:41,756 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-10 07:48:42,129 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 07:48:42,360 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:48:42,635 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:48:43,089 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:48:43,478 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:48:43,811 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 07:48:43,984 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:48:44,360 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:48:45,185 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:48:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:46,023 INFO L93 Difference]: Finished difference Result 951 states and 1279 transitions. [2019-09-10 07:48:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:48:46,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2019-09-10 07:48:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:46,027 INFO L225 Difference]: With dead ends: 951 [2019-09-10 07:48:46,027 INFO L226 Difference]: Without dead ends: 951 [2019-09-10 07:48:46,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=417, Invalid=1475, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:48:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-10 07:48:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 248. [2019-09-10 07:48:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 07:48:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2019-09-10 07:48:46,036 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 73 [2019-09-10 07:48:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:46,036 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2019-09-10 07:48:46,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2019-09-10 07:48:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 07:48:46,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:46,038 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 07:48:46,038 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982386, now seen corresponding path program 1 times [2019-09-10 07:48:46,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:46,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:46,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:46,171 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 07:48:46,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:46,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:46,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:46,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:46,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:46,173 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand 9 states. [2019-09-10 07:48:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:46,790 INFO L93 Difference]: Finished difference Result 393 states and 508 transitions. [2019-09-10 07:48:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:48:46,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-10 07:48:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:46,792 INFO L225 Difference]: With dead ends: 393 [2019-09-10 07:48:46,792 INFO L226 Difference]: Without dead ends: 393 [2019-09-10 07:48:46,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:48:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-10 07:48:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 248. [2019-09-10 07:48:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 07:48:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 309 transitions. [2019-09-10 07:48:46,798 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 309 transitions. Word has length 74 [2019-09-10 07:48:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:46,798 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 309 transitions. [2019-09-10 07:48:46,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 309 transitions. [2019-09-10 07:48:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:48:46,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:46,799 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] [2019-09-10 07:48:46,800 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2063860178, now seen corresponding path program 1 times [2019-09-10 07:48:46,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:46,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:47,119 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 07:48:47,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:47,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:47,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:47,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:47,120 INFO L87 Difference]: Start difference. First operand 248 states and 309 transitions. Second operand 9 states. [2019-09-10 07:48:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,109 INFO L93 Difference]: Finished difference Result 509 states and 674 transitions. [2019-09-10 07:48:48,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:48:48,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:48:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,113 INFO L225 Difference]: With dead ends: 509 [2019-09-10 07:48:48,113 INFO L226 Difference]: Without dead ends: 509 [2019-09-10 07:48:48,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:48:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-10 07:48:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 248. [2019-09-10 07:48:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 07:48:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 308 transitions. [2019-09-10 07:48:48,120 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 308 transitions. Word has length 75 [2019-09-10 07:48:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,120 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 308 transitions. [2019-09-10 07:48:48,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 308 transitions. [2019-09-10 07:48:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:48:48,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,121 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] [2019-09-10 07:48:48,122 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1495566453, now seen corresponding path program 1 times [2019-09-10 07:48:48,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:48,247 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 07:48:48,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:48,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:48:48,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:48,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:48:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:48:48,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:48:48,249 INFO L87 Difference]: Start difference. First operand 248 states and 308 transitions. Second operand 9 states. [2019-09-10 07:48:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:48,841 INFO L93 Difference]: Finished difference Result 402 states and 514 transitions. [2019-09-10 07:48:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:48:48,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-10 07:48:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:48,844 INFO L225 Difference]: With dead ends: 402 [2019-09-10 07:48:48,844 INFO L226 Difference]: Without dead ends: 402 [2019-09-10 07:48:48,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:48:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-10 07:48:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 248. [2019-09-10 07:48:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 07:48:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 307 transitions. [2019-09-10 07:48:48,852 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 307 transitions. Word has length 75 [2019-09-10 07:48:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:48,852 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 307 transitions. [2019-09-10 07:48:48,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:48:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 307 transitions. [2019-09-10 07:48:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 07:48:48,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:48,853 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 07:48:48,854 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1970985129, now seen corresponding path program 1 times [2019-09-10 07:48:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:48,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:49,624 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 07:48:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:49,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 07:48:49,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:49,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:48:49,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:48:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:48:49,626 INFO L87 Difference]: Start difference. First operand 248 states and 307 transitions. Second operand 21 states. [2019-09-10 07:48:49,796 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:48:50,720 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:48:50,885 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:48:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:54,677 INFO L93 Difference]: Finished difference Result 1201 states and 1652 transitions. [2019-09-10 07:48:54,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:48:54,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-10 07:48:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:54,684 INFO L225 Difference]: With dead ends: 1201 [2019-09-10 07:48:54,684 INFO L226 Difference]: Without dead ends: 1201 [2019-09-10 07:48:54,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 07:48:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-10 07:48:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 267. [2019-09-10 07:48:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-10 07:48:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2019-09-10 07:48:54,692 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 76 [2019-09-10 07:48:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:54,692 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2019-09-10 07:48:54,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:48:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2019-09-10 07:48:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:48:54,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:54,693 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 07:48:54,693 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1254231081, now seen corresponding path program 1 times [2019-09-10 07:48:54,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:54,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:54,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:55,073 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 07:48:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:48:55,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:55,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:48:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:48:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:48:55,075 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand 12 states. [2019-09-10 07:48:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:55,890 INFO L93 Difference]: Finished difference Result 629 states and 846 transitions. [2019-09-10 07:48:55,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:48:55,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-09-10 07:48:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:55,893 INFO L225 Difference]: With dead ends: 629 [2019-09-10 07:48:55,893 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 07:48:55,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:48:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 07:48:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 260. [2019-09-10 07:48:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-10 07:48:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 322 transitions. [2019-09-10 07:48:55,900 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 322 transitions. Word has length 77 [2019-09-10 07:48:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 322 transitions. [2019-09-10 07:48:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:48:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 322 transitions. [2019-09-10 07:48:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:48:55,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:55,901 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 07:48:55,902 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1521511757, now seen corresponding path program 1 times [2019-09-10 07:48:55,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:55,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:55,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:56,315 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 07:48:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:48:56,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:56,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:48:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:48:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:48:56,316 INFO L87 Difference]: Start difference. First operand 260 states and 322 transitions. Second operand 13 states. [2019-09-10 07:48:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:48:57,848 INFO L93 Difference]: Finished difference Result 850 states and 1174 transitions. [2019-09-10 07:48:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:48:57,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-10 07:48:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:48:57,857 INFO L225 Difference]: With dead ends: 850 [2019-09-10 07:48:57,857 INFO L226 Difference]: Without dead ends: 850 [2019-09-10 07:48:57,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-10 07:48:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-10 07:48:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 240. [2019-09-10 07:48:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 07:48:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 301 transitions. [2019-09-10 07:48:57,864 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 301 transitions. Word has length 77 [2019-09-10 07:48:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:48:57,865 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 301 transitions. [2019-09-10 07:48:57,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:48:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 301 transitions. [2019-09-10 07:48:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:48:57,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:48:57,866 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 07:48:57,866 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:48:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:48:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2017824198, now seen corresponding path program 1 times [2019-09-10 07:48:57,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:48:57,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:57,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:48:57,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:48:57,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:48:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:48:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:48:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:48:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 07:48:59,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:48:59,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:48:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:48:59,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:48:59,139 INFO L87 Difference]: Start difference. First operand 240 states and 301 transitions. Second operand 22 states. [2019-09-10 07:48:59,292 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 07:48:59,809 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:49:00,004 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 07:49:00,242 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-10 07:49:00,454 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:49:00,701 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-10 07:49:00,916 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:49:01,129 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:49:01,371 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 07:49:01,585 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-10 07:49:01,770 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:49:01,953 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:49:02,305 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:49:02,994 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:49:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:05,430 INFO L93 Difference]: Finished difference Result 1199 states and 1675 transitions. [2019-09-10 07:49:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:49:05,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-09-10 07:49:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:05,435 INFO L225 Difference]: With dead ends: 1199 [2019-09-10 07:49:05,435 INFO L226 Difference]: Without dead ends: 1199 [2019-09-10 07:49:05,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:49:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-10 07:49:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 246. [2019-09-10 07:49:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-10 07:49:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2019-09-10 07:49:05,445 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 77 [2019-09-10 07:49:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:05,445 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2019-09-10 07:49:05,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:49:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2019-09-10 07:49:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:49:05,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:05,447 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 07:49:05,447 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash -426565732, now seen corresponding path program 1 times [2019-09-10 07:49:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:05,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:05,763 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 07:49:05,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:05,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:49:05,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:05,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:49:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:49:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:49:05,765 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand 10 states. [2019-09-10 07:49:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:06,742 INFO L93 Difference]: Finished difference Result 721 states and 1011 transitions. [2019-09-10 07:49:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:49:06,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-10 07:49:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:06,747 INFO L225 Difference]: With dead ends: 721 [2019-09-10 07:49:06,747 INFO L226 Difference]: Without dead ends: 721 [2019-09-10 07:49:06,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:49:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-10 07:49:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 213. [2019-09-10 07:49:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-10 07:49:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2019-09-10 07:49:06,753 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 78 [2019-09-10 07:49:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:06,754 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2019-09-10 07:49:06,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:49:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2019-09-10 07:49:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:49:06,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:06,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:06,755 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash 123664725, now seen corresponding path program 1 times [2019-09-10 07:49:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:06,834 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 07:49:06,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:06,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:06,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:06,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:06,836 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. Second operand 3 states. [2019-09-10 07:49:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:06,862 INFO L93 Difference]: Finished difference Result 310 states and 410 transitions. [2019-09-10 07:49:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:06,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:49:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:06,864 INFO L225 Difference]: With dead ends: 310 [2019-09-10 07:49:06,865 INFO L226 Difference]: Without dead ends: 310 [2019-09-10 07:49:06,865 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 07:49:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-10 07:49:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-09-10 07:49:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-10 07:49:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 409 transitions. [2019-09-10 07:49:06,869 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 409 transitions. Word has length 100 [2019-09-10 07:49:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:06,870 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 409 transitions. [2019-09-10 07:49:06,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 409 transitions. [2019-09-10 07:49:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:06,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:06,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:06,872 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 584012325, now seen corresponding path program 1 times [2019-09-10 07:49:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:06,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 07:49:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:06,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:06,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:06,929 INFO L87 Difference]: Start difference. First operand 308 states and 409 transitions. Second operand 3 states. [2019-09-10 07:49:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:06,952 INFO L93 Difference]: Finished difference Result 488 states and 662 transitions. [2019-09-10 07:49:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:06,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:49:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:06,955 INFO L225 Difference]: With dead ends: 488 [2019-09-10 07:49:06,955 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 07:49:06,955 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 07:49:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 07:49:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2019-09-10 07:49:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-10 07:49:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2019-09-10 07:49:06,961 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 102 [2019-09-10 07:49:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:06,962 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2019-09-10 07:49:06,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2019-09-10 07:49:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:06,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:06,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:06,963 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:06,964 INFO L82 PathProgramCache]: Analyzing trace with hash 650505837, now seen corresponding path program 1 times [2019-09-10 07:49:06,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:06,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:06,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:06,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:07,031 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 07:49:07,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:07,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:07,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:07,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:07,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:07,032 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand 3 states. [2019-09-10 07:49:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:07,062 INFO L93 Difference]: Finished difference Result 680 states and 934 transitions. [2019-09-10 07:49:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:07,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:49:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:07,066 INFO L225 Difference]: With dead ends: 680 [2019-09-10 07:49:07,066 INFO L226 Difference]: Without dead ends: 680 [2019-09-10 07:49:07,066 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 07:49:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-10 07:49:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2019-09-10 07:49:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-10 07:49:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 933 transitions. [2019-09-10 07:49:07,076 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 933 transitions. Word has length 102 [2019-09-10 07:49:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:07,077 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 933 transitions. [2019-09-10 07:49:07,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 933 transitions. [2019-09-10 07:49:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:07,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:07,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:07,078 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 184976012, now seen corresponding path program 1 times [2019-09-10 07:49:07,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:07,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:07,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:07,149 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 07:49:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:49:07,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:07,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:49:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:49:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:49:07,151 INFO L87 Difference]: Start difference. First operand 678 states and 933 transitions. Second operand 5 states. [2019-09-10 07:49:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:07,403 INFO L93 Difference]: Finished difference Result 2364 states and 3240 transitions. [2019-09-10 07:49:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:49:07,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:49:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:07,419 INFO L225 Difference]: With dead ends: 2364 [2019-09-10 07:49:07,419 INFO L226 Difference]: Without dead ends: 2364 [2019-09-10 07:49:07,419 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 07:49:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-09-10 07:49:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 1294. [2019-09-10 07:49:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-09-10 07:49:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1797 transitions. [2019-09-10 07:49:07,443 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1797 transitions. Word has length 102 [2019-09-10 07:49:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:07,444 INFO L475 AbstractCegarLoop]: Abstraction has 1294 states and 1797 transitions. [2019-09-10 07:49:07,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:49:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1797 transitions. [2019-09-10 07:49:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:07,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:07,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:07,446 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2060125324, now seen corresponding path program 1 times [2019-09-10 07:49:07,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:07,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:07,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:07,539 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 07:49:07,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:07,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:49:07,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:07,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:49:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:49:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:49:07,542 INFO L87 Difference]: Start difference. First operand 1294 states and 1797 transitions. Second operand 5 states. [2019-09-10 07:49:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:07,772 INFO L93 Difference]: Finished difference Result 4088 states and 5604 transitions. [2019-09-10 07:49:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:49:07,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:49:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:07,780 INFO L225 Difference]: With dead ends: 4088 [2019-09-10 07:49:07,780 INFO L226 Difference]: Without dead ends: 4088 [2019-09-10 07:49:07,781 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 07:49:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-09-10 07:49:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 2574. [2019-09-10 07:49:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2019-09-10 07:49:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3573 transitions. [2019-09-10 07:49:07,817 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3573 transitions. Word has length 102 [2019-09-10 07:49:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:07,817 INFO L475 AbstractCegarLoop]: Abstraction has 2574 states and 3573 transitions. [2019-09-10 07:49:07,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:49:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3573 transitions. [2019-09-10 07:49:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:07,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:07,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:07,819 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1870756212, now seen corresponding path program 1 times [2019-09-10 07:49:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:07,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:07,884 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 07:49:07,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:07,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:49:07,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:07,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:49:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:49:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:49:07,885 INFO L87 Difference]: Start difference. First operand 2574 states and 3573 transitions. Second operand 5 states. [2019-09-10 07:49:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:08,112 INFO L93 Difference]: Finished difference Result 6957 states and 9501 transitions. [2019-09-10 07:49:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:49:08,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:49:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:08,125 INFO L225 Difference]: With dead ends: 6957 [2019-09-10 07:49:08,126 INFO L226 Difference]: Without dead ends: 6957 [2019-09-10 07:49:08,126 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 07:49:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-10 07:49:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 4162. [2019-09-10 07:49:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-09-10 07:49:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 5737 transitions. [2019-09-10 07:49:08,192 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 5737 transitions. Word has length 102 [2019-09-10 07:49:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:08,193 INFO L475 AbstractCegarLoop]: Abstraction has 4162 states and 5737 transitions. [2019-09-10 07:49:08,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:49:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 5737 transitions. [2019-09-10 07:49:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:49:08,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:08,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:08,195 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1130297204, now seen corresponding path program 1 times [2019-09-10 07:49:08,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:08,267 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 07:49:08,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:08,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:49:08,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:08,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:49:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:49:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:49:08,269 INFO L87 Difference]: Start difference. First operand 4162 states and 5737 transitions. Second operand 5 states. [2019-09-10 07:49:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:08,471 INFO L93 Difference]: Finished difference Result 8916 states and 12016 transitions. [2019-09-10 07:49:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:49:08,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 07:49:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:08,488 INFO L225 Difference]: With dead ends: 8916 [2019-09-10 07:49:08,489 INFO L226 Difference]: Without dead ends: 8916 [2019-09-10 07:49:08,489 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 07:49:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2019-09-10 07:49:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 5166. [2019-09-10 07:49:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-09-10 07:49:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6985 transitions. [2019-09-10 07:49:08,569 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6985 transitions. Word has length 102 [2019-09-10 07:49:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:08,569 INFO L475 AbstractCegarLoop]: Abstraction has 5166 states and 6985 transitions. [2019-09-10 07:49:08,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:49:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6985 transitions. [2019-09-10 07:49:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:49:08,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:08,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:08,572 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:08,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:08,572 INFO L82 PathProgramCache]: Analyzing trace with hash 946884168, now seen corresponding path program 1 times [2019-09-10 07:49:08,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:08,634 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 07:49:08,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:08,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:08,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:08,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:08,636 INFO L87 Difference]: Start difference. First operand 5166 states and 6985 transitions. Second operand 3 states. [2019-09-10 07:49:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:08,667 INFO L93 Difference]: Finished difference Result 4880 states and 6482 transitions. [2019-09-10 07:49:08,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:08,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 07:49:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:08,679 INFO L225 Difference]: With dead ends: 4880 [2019-09-10 07:49:08,679 INFO L226 Difference]: Without dead ends: 4880 [2019-09-10 07:49:08,679 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 07:49:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2019-09-10 07:49:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 3722. [2019-09-10 07:49:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2019-09-10 07:49:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 4926 transitions. [2019-09-10 07:49:08,726 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 4926 transitions. Word has length 103 [2019-09-10 07:49:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:08,726 INFO L475 AbstractCegarLoop]: Abstraction has 3722 states and 4926 transitions. [2019-09-10 07:49:08,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 4926 transitions. [2019-09-10 07:49:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:49:08,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:08,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:08,728 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1583660251, now seen corresponding path program 1 times [2019-09-10 07:49:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:08,793 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 07:49:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:08,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:08,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:08,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:08,794 INFO L87 Difference]: Start difference. First operand 3722 states and 4926 transitions. Second operand 3 states. [2019-09-10 07:49:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:08,818 INFO L93 Difference]: Finished difference Result 3580 states and 4651 transitions. [2019-09-10 07:49:08,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:08,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:49:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:08,826 INFO L225 Difference]: With dead ends: 3580 [2019-09-10 07:49:08,826 INFO L226 Difference]: Without dead ends: 3580 [2019-09-10 07:49:08,826 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 07:49:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2019-09-10 07:49:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3260. [2019-09-10 07:49:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2019-09-10 07:49:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4266 transitions. [2019-09-10 07:49:08,863 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4266 transitions. Word has length 104 [2019-09-10 07:49:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:08,863 INFO L475 AbstractCegarLoop]: Abstraction has 3260 states and 4266 transitions. [2019-09-10 07:49:08,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4266 transitions. [2019-09-10 07:49:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:49:08,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:08,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:08,865 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1318773056, now seen corresponding path program 1 times [2019-09-10 07:49:08,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:08,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:08,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 07:49:08,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:08,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:08,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:08,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:08,922 INFO L87 Difference]: Start difference. First operand 3260 states and 4266 transitions. Second operand 3 states. [2019-09-10 07:49:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:08,947 INFO L93 Difference]: Finished difference Result 3590 states and 4670 transitions. [2019-09-10 07:49:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:08,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 07:49:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:08,953 INFO L225 Difference]: With dead ends: 3590 [2019-09-10 07:49:08,953 INFO L226 Difference]: Without dead ends: 3590 [2019-09-10 07:49:08,954 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 07:49:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-09-10 07:49:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-09-10 07:49:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-09-10 07:49:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4669 transitions. [2019-09-10 07:49:08,990 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4669 transitions. Word has length 105 [2019-09-10 07:49:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:08,991 INFO L475 AbstractCegarLoop]: Abstraction has 3588 states and 4669 transitions. [2019-09-10 07:49:08,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4669 transitions. [2019-09-10 07:49:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:49:08,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:08,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:08,992 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:08,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1379426431, now seen corresponding path program 1 times [2019-09-10 07:49:08,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:08,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:09,094 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 07:49:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:09,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:49:09,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:09,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:49:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:49:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:49:09,096 INFO L87 Difference]: Start difference. First operand 3588 states and 4669 transitions. Second operand 6 states. [2019-09-10 07:49:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:09,174 INFO L93 Difference]: Finished difference Result 5320 states and 6853 transitions. [2019-09-10 07:49:09,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:49:09,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 07:49:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:09,185 INFO L225 Difference]: With dead ends: 5320 [2019-09-10 07:49:09,185 INFO L226 Difference]: Without dead ends: 5320 [2019-09-10 07:49:09,185 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 07:49:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2019-09-10 07:49:09,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3642. [2019-09-10 07:49:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-09-10 07:49:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4705 transitions. [2019-09-10 07:49:09,232 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4705 transitions. Word has length 105 [2019-09-10 07:49:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:09,232 INFO L475 AbstractCegarLoop]: Abstraction has 3642 states and 4705 transitions. [2019-09-10 07:49:09,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:49:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4705 transitions. [2019-09-10 07:49:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 07:49:09,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:09,236 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:09,236 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1107526132, now seen corresponding path program 1 times [2019-09-10 07:49:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 07:49:09,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:09,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:49:09,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:09,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:49:09,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:49:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:49:09,312 INFO L87 Difference]: Start difference. First operand 3642 states and 4705 transitions. Second operand 3 states. [2019-09-10 07:49:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:09,337 INFO L93 Difference]: Finished difference Result 4448 states and 5662 transitions. [2019-09-10 07:49:09,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:49:09,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-10 07:49:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:09,344 INFO L225 Difference]: With dead ends: 4448 [2019-09-10 07:49:09,344 INFO L226 Difference]: Without dead ends: 4448 [2019-09-10 07:49:09,345 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 07:49:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-09-10 07:49:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4286. [2019-09-10 07:49:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-09-10 07:49:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5501 transitions. [2019-09-10 07:49:09,393 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5501 transitions. Word has length 131 [2019-09-10 07:49:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:09,393 INFO L475 AbstractCegarLoop]: Abstraction has 4286 states and 5501 transitions. [2019-09-10 07:49:09,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:49:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5501 transitions. [2019-09-10 07:49:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:49:09,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:09,397 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:09,397 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -965154483, now seen corresponding path program 1 times [2019-09-10 07:49:09,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:49:09,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:49:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:49:09,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:09,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:49:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:49:09,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:49:09,546 INFO L87 Difference]: Start difference. First operand 4286 states and 5501 transitions. Second operand 6 states. [2019-09-10 07:49:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:09,688 INFO L93 Difference]: Finished difference Result 16738 states and 21391 transitions. [2019-09-10 07:49:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:49:09,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:49:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:09,709 INFO L225 Difference]: With dead ends: 16738 [2019-09-10 07:49:09,710 INFO L226 Difference]: Without dead ends: 16738 [2019-09-10 07:49:09,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:49:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16738 states. [2019-09-10 07:49:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16738 to 6966. [2019-09-10 07:49:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-09-10 07:49:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 8889 transitions. [2019-09-10 07:49:09,993 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 8889 transitions. Word has length 132 [2019-09-10 07:49:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:09,993 INFO L475 AbstractCegarLoop]: Abstraction has 6966 states and 8889 transitions. [2019-09-10 07:49:09,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:49:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 8889 transitions. [2019-09-10 07:49:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:49:09,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:09,997 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:09,997 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 909994829, now seen corresponding path program 1 times [2019-09-10 07:49:09,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:09,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:10,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:10,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:10,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:49:10,137 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1991], [1993], [1995], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:10,196 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:10,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:10,412 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:11,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:11,367 INFO L272 AbstractInterpreter]: Visited 120 different actions 559 times. Merged at 44 different actions 394 times. Widened at 19 different actions 80 times. Performed 2175 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2175 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 271 variables. [2019-09-10 07:49:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:11,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:11,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:11,374 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 07:49:11,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:11,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:11,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:49:11,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:49:11,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:49:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:49:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:49:11,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:11,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:49:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:49:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:11,867 INFO L87 Difference]: Start difference. First operand 6966 states and 8889 transitions. Second operand 6 states. [2019-09-10 07:49:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:12,006 INFO L93 Difference]: Finished difference Result 19502 states and 24917 transitions. [2019-09-10 07:49:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:49:12,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:49:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:12,041 INFO L225 Difference]: With dead ends: 19502 [2019-09-10 07:49:12,042 INFO L226 Difference]: Without dead ends: 19502 [2019-09-10 07:49:12,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19502 states. [2019-09-10 07:49:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19502 to 10962. [2019-09-10 07:49:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10962 states. [2019-09-10 07:49:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 13911 transitions. [2019-09-10 07:49:12,283 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 13911 transitions. Word has length 132 [2019-09-10 07:49:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:12,283 INFO L475 AbstractCegarLoop]: Abstraction has 10962 states and 13911 transitions. [2019-09-10 07:49:12,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:49:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 13911 transitions. [2019-09-10 07:49:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 07:49:12,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:12,287 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:12,287 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1274080589, now seen corresponding path program 1 times [2019-09-10 07:49:12,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:12,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:12,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:12,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:12,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:12,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:12,432 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2019-09-10 07:49:12,433 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:12,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:12,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:12,499 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:12,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:12,981 INFO L272 AbstractInterpreter]: Visited 120 different actions 495 times. Merged at 44 different actions 334 times. Widened at 18 different actions 62 times. Performed 1949 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1949 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 13 different actions. Largest state had 271 variables. [2019-09-10 07:49:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:12,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:12,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:12,982 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 07:49:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:13,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:13,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:49:13,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:49:13,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 07:49:13,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:49:13,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:49:13,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:13,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:49:13,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:49:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:13,411 INFO L87 Difference]: Start difference. First operand 10962 states and 13911 transitions. Second operand 6 states. [2019-09-10 07:49:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:13,542 INFO L93 Difference]: Finished difference Result 22284 states and 28437 transitions. [2019-09-10 07:49:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:49:13,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 07:49:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:13,573 INFO L225 Difference]: With dead ends: 22284 [2019-09-10 07:49:13,573 INFO L226 Difference]: Without dead ends: 22284 [2019-09-10 07:49:13,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22284 states. [2019-09-10 07:49:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22284 to 13642. [2019-09-10 07:49:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13642 states. [2019-09-10 07:49:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13642 states to 13642 states and 17299 transitions. [2019-09-10 07:49:13,849 INFO L78 Accepts]: Start accepts. Automaton has 13642 states and 17299 transitions. Word has length 132 [2019-09-10 07:49:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:13,850 INFO L475 AbstractCegarLoop]: Abstraction has 13642 states and 17299 transitions. [2019-09-10 07:49:13,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:49:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13642 states and 17299 transitions. [2019-09-10 07:49:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:49:13,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:13,854 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:49:13,854 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -347422809, now seen corresponding path program 1 times [2019-09-10 07:49:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:13,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:14,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:14,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:14,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:49:14,166 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [199], [201], [204], [208], [210], [215], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:14,175 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:14,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:14,231 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:14,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:14,890 INFO L272 AbstractInterpreter]: Visited 120 different actions 646 times. Merged at 44 different actions 463 times. Widened at 21 different actions 110 times. Performed 2425 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 68 fixpoints after 21 different actions. Largest state had 271 variables. [2019-09-10 07:49:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:14,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:14,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:14,890 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:14,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:14,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:15,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:49:15,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:49:15,211 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:49:15,313 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:49:15,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [12] total 17 [2019-09-10 07:49:15,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:15,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:49:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:49:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:49:15,315 INFO L87 Difference]: Start difference. First operand 13642 states and 17299 transitions. Second operand 5 states. [2019-09-10 07:49:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:15,431 INFO L93 Difference]: Finished difference Result 21832 states and 26996 transitions. [2019-09-10 07:49:15,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:49:15,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 07:49:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:15,465 INFO L225 Difference]: With dead ends: 21832 [2019-09-10 07:49:15,466 INFO L226 Difference]: Without dead ends: 21832 [2019-09-10 07:49:15,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:49:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21832 states. [2019-09-10 07:49:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21832 to 20006. [2019-09-10 07:49:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20006 states. [2019-09-10 07:49:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 25049 transitions. [2019-09-10 07:49:15,718 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 25049 transitions. Word has length 133 [2019-09-10 07:49:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:15,719 INFO L475 AbstractCegarLoop]: Abstraction has 20006 states and 25049 transitions. [2019-09-10 07:49:15,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:49:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 25049 transitions. [2019-09-10 07:49:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 07:49:15,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:15,723 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, 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 07:49:15,723 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1380667028, now seen corresponding path program 1 times [2019-09-10 07:49:15,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:15,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:15,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:15,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:15,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:15,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 07:49:15,848 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1918], [1921], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:15,853 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:15,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:15,907 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:16,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:16,489 INFO L272 AbstractInterpreter]: Visited 124 different actions 652 times. Merged at 48 different actions 462 times. Widened at 22 different actions 93 times. Performed 2634 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2634 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 56 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:49:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:16,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:16,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:16,490 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:16,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:16,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:16,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 07:49:16,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:49:16,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:49:16,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:49:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2019-09-10 07:49:16,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:49:16,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:49:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:49:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:16,908 INFO L87 Difference]: Start difference. First operand 20006 states and 25049 transitions. Second operand 6 states. [2019-09-10 07:49:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:17,176 INFO L93 Difference]: Finished difference Result 36410 states and 45787 transitions. [2019-09-10 07:49:17,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:49:17,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 07:49:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:17,223 INFO L225 Difference]: With dead ends: 36410 [2019-09-10 07:49:17,223 INFO L226 Difference]: Without dead ends: 36410 [2019-09-10 07:49:17,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 259 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:49:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36410 states. [2019-09-10 07:49:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36410 to 23958. [2019-09-10 07:49:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23958 states. [2019-09-10 07:49:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23958 states to 23958 states and 29985 transitions. [2019-09-10 07:49:17,578 INFO L78 Accepts]: Start accepts. Automaton has 23958 states and 29985 transitions. Word has length 133 [2019-09-10 07:49:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:49:17,578 INFO L475 AbstractCegarLoop]: Abstraction has 23958 states and 29985 transitions. [2019-09-10 07:49:17,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:49:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23958 states and 29985 transitions. [2019-09-10 07:49:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 07:49:17,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:49:17,583 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 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 07:49:17,584 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:49:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:17,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1477364032, now seen corresponding path program 1 times [2019-09-10 07:49:17,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:49:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:17,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:49:17,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:49:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:17,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:17,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:49:17,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 07:49:17,938 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [199], [201], [204], [208], [210], [215], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1709], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:49:17,942 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:49:17,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:49:18,041 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:49:18,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:49:18,874 INFO L272 AbstractInterpreter]: Visited 124 different actions 739 times. Merged at 48 different actions 534 times. Widened at 23 different actions 98 times. Performed 2807 root evaluator evaluations with a maximum evaluation depth of 6. Performed 2807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 87 fixpoints after 20 different actions. Largest state had 272 variables. [2019-09-10 07:49:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:49:18,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:49:18,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:49:18,875 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:49:18,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:49:18,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:49:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:49:19,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 07:49:19,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:49:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:19,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:19,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:49:20,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:22,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:49:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:49:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:49:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:49:22,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:49:22,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:49:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:49:22,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:49:22,225 INFO L87 Difference]: Start difference. First operand 23958 states and 29985 transitions. Second operand 21 states. [2019-09-10 07:49:22,370 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:49:24,383 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 07:49:24,544 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:49:24,842 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:25,146 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 07:49:25,324 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:49:25,505 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:25,803 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:25,938 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-10 07:49:26,261 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:26,592 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:26,780 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:49:27,037 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:27,880 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:49:28,040 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:49:28,616 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 07:49:28,797 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:49:29,339 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:49:29,551 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:49:29,884 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:49:30,031 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:49:30,236 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:30,429 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:30,632 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:30,790 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:31,144 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:31,331 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:31,530 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 07:49:31,694 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 07:49:31,887 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:49:32,072 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:49:32,247 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:49:32,388 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:49:32,563 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:49:32,733 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:49:33,581 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:49:33,746 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:33,934 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:49:34,126 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:49:34,314 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 07:49:34,458 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:49:34,754 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:34,933 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:49:35,105 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:35,475 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 07:49:35,789 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:36,006 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:49:36,308 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:37,130 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:49:37,553 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 07:49:37,792 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-09-10 07:49:38,055 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-10 07:49:38,236 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:49:38,418 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:49:38,593 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-09-10 07:49:38,823 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 07:49:39,114 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:49:39,269 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:49:39,697 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:39,974 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:40,138 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 07:49:40,304 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:40,490 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:49:40,664 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:49:40,949 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-09-10 07:49:41,095 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:49:41,249 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:49:41,870 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:49:42,050 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:49:42,245 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:49:42,400 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:49:42,589 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:49:42,745 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:49:43,092 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:49:43,258 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 07:49:43,446 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:49:43,928 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:49:44,403 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:49:44,587 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 07:49:44,933 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 07:49:45,129 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 07:49:45,391 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:49:45,581 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-09-10 07:49:46,272 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:49:46,437 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:49:46,735 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 07:49:46,913 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 07:49:47,084 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:49:47,262 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:49:47,890 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 07:49:48,146 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:49:48,335 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:49:48,506 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-09-10 07:49:48,706 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:49:48,857 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:49:49,050 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 07:49:49,414 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:49,602 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 07:49:49,796 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 07:49:50,004 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:49:50,151 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:49:50,403 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:50,587 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:49:50,795 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-09-10 07:49:51,088 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:49:51,682 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 07:49:51,865 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 07:49:52,020 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 07:49:52,178 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 07:49:52,445 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-09-10 07:49:52,642 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:49:52,797 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 07:49:52,954 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2019-09-10 07:49:53,401 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:49:53,721 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:49:53,886 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:54,057 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 07:49:54,393 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:54,567 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2019-09-10 07:49:54,725 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-09-10 07:49:55,098 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:55,290 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:55,488 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-09-10 07:49:55,639 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:49:55,843 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 07:49:56,034 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 07:49:56,199 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-09-10 07:49:56,384 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 07:49:56,668 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-10 07:49:56,889 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-09-10 07:49:57,069 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-09-10 07:49:57,297 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:49:57,452 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 07:49:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:49:57,596 INFO L93 Difference]: Finished difference Result 197666 states and 240784 transitions. [2019-09-10 07:49:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-10 07:49:57,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 134 [2019-09-10 07:49:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:49:57,856 INFO L225 Difference]: With dead ends: 197666 [2019-09-10 07:49:57,856 INFO L226 Difference]: Without dead ends: 197666 [2019-09-10 07:49:57,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 217 SyntacticMatches, 34 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20581 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=8500, Invalid=45556, Unknown=0, NotChecked=0, Total=54056 [2019-09-10 07:49:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197666 states. [2019-09-10 07:50:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197666 to 72603. [2019-09-10 07:50:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72603 states. [2019-09-10 07:50:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72603 states to 72603 states and 90211 transitions. [2019-09-10 07:50:00,781 INFO L78 Accepts]: Start accepts. Automaton has 72603 states and 90211 transitions. Word has length 134 [2019-09-10 07:50:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:00,782 INFO L475 AbstractCegarLoop]: Abstraction has 72603 states and 90211 transitions. [2019-09-10 07:50:00,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:50:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 72603 states and 90211 transitions. [2019-09-10 07:50:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 07:50:00,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:00,795 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, 1, 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 07:50:00,795 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:00,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1278379019, now seen corresponding path program 1 times [2019-09-10 07:50:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:00,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 07:50:00,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:50:00,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:50:00,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:50:00,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:50:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:50:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:50:00,935 INFO L87 Difference]: Start difference. First operand 72603 states and 90211 transitions. Second operand 9 states. [2019-09-10 07:50:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:50:01,731 INFO L93 Difference]: Finished difference Result 108377 states and 134887 transitions. [2019-09-10 07:50:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:50:01,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 07:50:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:50:01,881 INFO L225 Difference]: With dead ends: 108377 [2019-09-10 07:50:01,882 INFO L226 Difference]: Without dead ends: 108377 [2019-09-10 07:50:01,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:50:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108377 states. [2019-09-10 07:50:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108377 to 72603. [2019-09-10 07:50:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72603 states. [2019-09-10 07:50:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72603 states to 72603 states and 90206 transitions. [2019-09-10 07:50:04,714 INFO L78 Accepts]: Start accepts. Automaton has 72603 states and 90206 transitions. Word has length 135 [2019-09-10 07:50:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:50:04,714 INFO L475 AbstractCegarLoop]: Abstraction has 72603 states and 90206 transitions. [2019-09-10 07:50:04,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:50:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 72603 states and 90206 transitions. [2019-09-10 07:50:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:50:04,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:50:04,732 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1, 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 07:50:04,733 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:50:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 445688151, now seen corresponding path program 1 times [2019-09-10 07:50:04,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:50:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:04,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:50:04,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:50:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:05,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:05,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:50:05,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 07:50:05,000 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [199], [201], [204], [208], [210], [215], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1236], [1274], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1991], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:50:05,002 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:50:05,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:50:05,056 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:50:05,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:50:05,743 INFO L272 AbstractInterpreter]: Visited 127 different actions 840 times. Merged at 48 different actions 617 times. Widened at 23 different actions 123 times. Performed 3242 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 102 fixpoints after 23 different actions. Largest state had 272 variables. [2019-09-10 07:50:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:50:05,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:50:05,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:50:05,744 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:50:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:50:05,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:50:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:50:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:50:05,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:50:06,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:06,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:50:06,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:06,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:07,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:50:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:50:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:50:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2019-09-10 07:50:07,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:50:07,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:50:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:50:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:50:07,555 INFO L87 Difference]: Start difference. First operand 72603 states and 90206 transitions. Second operand 21 states. [2019-09-10 07:50:09,550 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-09-10 07:50:11,597 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:12,200 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:13,039 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:50:13,401 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:50:13,770 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:14,425 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:50:14,588 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:50:16,217 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:16,380 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:17,200 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:50:18,640 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:50:18,815 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-10 07:50:19,954 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:50:20,160 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:50:20,331 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:50:20,482 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 07:50:20,654 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:50:20,826 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-10 07:50:21,086 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:50:21,783 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:22,129 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:22,295 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:50:22,469 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:50:22,643 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:50:22,833 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:50:23,331 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 07:50:23,473 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 07:50:24,165 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:50:24,448 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 07:50:24,750 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:25,126 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:25,976 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:50:27,942 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:50:28,100 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:50:28,286 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-10 07:50:28,451 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-10 07:50:31,123 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:31,278 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:31,695 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 07:50:31,853 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:50:31,993 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-10 07:50:32,605 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:50:32,769 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:50:32,963 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:50:33,202 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:50:34,774 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-10 07:50:35,893 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:36,057 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:50:36,477 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:38,061 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:50:39,314 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 07:50:39,460 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-10 07:50:40,759 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:50:41,080 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 07:50:41,698 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-10 07:50:41,851 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:50:41,993 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:50:42,170 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 07:50:43,365 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-10 07:50:44,075 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:44,546 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 07:50:45,376 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 07:50:45,790 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:50:45,964 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:50:46,143 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:46,303 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-10 07:50:46,492 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:50:46,717 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 07:50:46,892 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:50:47,762 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:48,015 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:48,212 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-10 07:50:48,638 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 07:50:49,005 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-10 07:50:49,175 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 07:50:50,025 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 07:50:50,215 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:50,411 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-10 07:50:51,266 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:50:51,601 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:52,679 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-10 07:50:52,838 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-10 07:50:53,030 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:50:53,383 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:53,921 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 07:50:54,108 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:50:54,299 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:54,490 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-10 07:50:54,665 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-10 07:50:55,401 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:50:55,548 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 07:50:55,753 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:55,924 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-10 07:50:56,087 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 07:50:56,236 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-10 07:50:56,431 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 07:50:57,341 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-10 07:50:57,498 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:50:58,036 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-10 07:50:58,802 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-10 07:50:58,949 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:50:59,330 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:59,555 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 07:50:59,758 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 07:50:59,911 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:51:00,075 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-10 07:51:00,958 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:51:01,119 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:51:01,328 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:51:01,511 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 07:51:01,669 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 07:51:01,882 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-10 07:51:02,951 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-10 07:51:03,299 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:51:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:05,003 INFO L93 Difference]: Finished difference Result 521031 states and 634794 transitions. [2019-09-10 07:51:05,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 358 states. [2019-09-10 07:51:05,004 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 137 [2019-09-10 07:51:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:05,718 INFO L225 Difference]: With dead ends: 521031 [2019-09-10 07:51:05,718 INFO L226 Difference]: Without dead ends: 521031 [2019-09-10 07:51:05,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 236 SyntacticMatches, 19 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61953 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=16597, Invalid=132785, Unknown=0, NotChecked=0, Total=149382 [2019-09-10 07:51:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521031 states. [2019-09-10 07:51:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521031 to 145611. [2019-09-10 07:51:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145611 states. [2019-09-10 07:51:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145611 states to 145611 states and 180064 transitions. [2019-09-10 07:51:12,187 INFO L78 Accepts]: Start accepts. Automaton has 145611 states and 180064 transitions. Word has length 137 [2019-09-10 07:51:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:12,188 INFO L475 AbstractCegarLoop]: Abstraction has 145611 states and 180064 transitions. [2019-09-10 07:51:12,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:51:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 145611 states and 180064 transitions. [2019-09-10 07:51:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:51:12,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:12,666 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, 1, 1, 1, 1, 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 07:51:12,666 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:12,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 744662228, now seen corresponding path program 1 times [2019-09-10 07:51:12,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:12,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:12,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:12,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:12,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:12,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:12,987 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 07:51:12,987 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1236], [1274], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1925], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:51:12,990 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:12,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:13,043 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:13,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:13,689 INFO L272 AbstractInterpreter]: Visited 129 different actions 707 times. Merged at 50 different actions 512 times. Widened at 20 different actions 100 times. Performed 2707 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:51:13,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:13,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:13,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:13,690 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:13,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:13,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:13,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:51:13,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:14,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:14,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:14,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:14,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 07:51:14,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:14,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:51:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:51:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:51:14,740 INFO L87 Difference]: Start difference. First operand 145611 states and 180064 transitions. Second operand 21 states. [2019-09-10 07:51:17,031 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-09-10 07:51:17,328 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-09-10 07:51:19,828 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 07:51:20,292 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 07:51:20,693 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 07:51:20,988 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-10 07:51:21,391 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 07:51:21,662 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-09-10 07:51:21,964 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2019-09-10 07:51:22,222 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-09-10 07:51:23,302 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:51:23,488 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:51:24,021 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 07:51:24,316 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 07:51:24,476 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2019-09-10 07:51:24,920 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2019-09-10 07:51:25,125 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-09-10 07:51:25,281 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-09-10 07:51:25,434 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:51:25,603 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-09-10 07:51:25,760 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:51:25,917 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-10 07:51:26,497 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-10 07:51:27,971 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-10 07:51:28,751 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 07:51:29,935 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-09-10 07:51:30,879 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-09-10 07:51:31,352 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:51:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:51:32,033 INFO L93 Difference]: Finished difference Result 378341 states and 462744 transitions. [2019-09-10 07:51:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 07:51:32,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2019-09-10 07:51:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:51:32,501 INFO L225 Difference]: With dead ends: 378341 [2019-09-10 07:51:32,502 INFO L226 Difference]: Without dead ends: 378341 [2019-09-10 07:51:32,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3976 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2860, Invalid=12392, Unknown=0, NotChecked=0, Total=15252 [2019-09-10 07:51:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378341 states. [2019-09-10 07:51:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378341 to 165967. [2019-09-10 07:51:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165967 states. [2019-09-10 07:51:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165967 states to 165967 states and 204528 transitions. [2019-09-10 07:51:35,414 INFO L78 Accepts]: Start accepts. Automaton has 165967 states and 204528 transitions. Word has length 138 [2019-09-10 07:51:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:51:35,414 INFO L475 AbstractCegarLoop]: Abstraction has 165967 states and 204528 transitions. [2019-09-10 07:51:35,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:51:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 165967 states and 204528 transitions. [2019-09-10 07:51:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 07:51:35,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:51:35,429 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, 1, 1, 1, 1, 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 07:51:35,430 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:51:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1052523478, now seen corresponding path program 1 times [2019-09-10 07:51:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:51:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:51:35,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:51:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:35,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:35,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:51:35,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 07:51:35,751 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [146], [193], [196], [201], [204], [208], [221], [223], [252], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1918], [1921], [1927], [1929], [1932], [1947], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:51:35,759 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:51:35,760 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:51:35,819 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:51:36,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:51:36,329 INFO L272 AbstractInterpreter]: Visited 129 different actions 675 times. Merged at 50 different actions 482 times. Widened at 17 different actions 84 times. Performed 2568 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2568 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 51 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:51:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:51:36,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:51:36,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:51:36,330 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:51:36,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:51:36,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:51:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:51:36,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:51:36,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:51:37,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:37,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:51:37,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:51:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:51:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:51:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 07:51:39,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:51:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:51:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:51:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:51:39,115 INFO L87 Difference]: Start difference. First operand 165967 states and 204528 transitions. Second operand 22 states. [2019-09-10 07:51:41,388 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-09-10 07:51:41,683 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:51:42,196 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-09-10 07:51:42,625 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:51:42,826 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:51:43,157 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:51:43,445 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-09-10 07:51:43,587 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:51:43,751 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-09-10 07:51:44,542 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 07:51:45,096 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:51:45,297 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:51:45,483 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 07:51:46,282 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:51:46,438 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-09-10 07:51:46,627 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:51:47,499 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-09-10 07:51:47,667 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 07:51:48,231 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:51:48,459 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2019-09-10 07:51:48,662 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-09-10 07:51:51,744 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:51:52,047 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-09-10 07:51:52,352 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 07:51:52,670 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 40 [2019-09-10 07:51:53,040 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:51:53,218 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-10 07:51:53,396 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-09-10 07:51:53,573 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-09-10 07:51:54,573 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-09-10 07:51:55,285 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-10 07:51:55,442 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 44 [2019-09-10 07:51:55,598 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 07:51:56,333 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:51:56,730 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-09-10 07:51:56,909 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-09-10 07:51:57,075 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-10 07:51:57,244 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:51:57,531 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-09-10 07:51:57,701 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-10 07:51:58,805 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-09-10 07:51:58,994 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-09-10 07:51:59,148 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-09-10 07:51:59,336 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:51:59,490 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:51:59,642 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 07:51:59,838 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-10 07:52:00,677 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:52:00,841 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2019-09-10 07:52:01,127 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-10 07:52:01,418 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-09-10 07:52:01,726 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:52:02,176 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-10 07:52:02,358 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 44 [2019-09-10 07:52:02,504 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-10 07:52:03,240 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-09-10 07:52:03,922 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-09-10 07:52:04,237 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 07:52:04,515 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 07:52:04,883 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-09-10 07:52:05,039 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 07:52:06,074 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 07:52:06,360 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-09-10 07:52:07,036 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-09-10 07:52:07,196 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-09-10 07:52:07,460 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-10 07:52:08,379 WARN L188 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-10 07:52:08,576 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2019-09-10 07:52:08,752 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-09-10 07:52:08,951 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:52:09,352 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-09-10 07:52:09,589 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:52:09,785 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 07:52:11,652 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 43 [2019-09-10 07:52:19,673 WARN L188 SmtUtils]: Spent 5.29 s on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2019-09-10 07:52:20,753 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2019-09-10 07:52:21,098 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-09-10 07:52:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:21,906 INFO L93 Difference]: Finished difference Result 1239477 states and 1496907 transitions. [2019-09-10 07:52:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-10 07:52:21,907 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2019-09-10 07:52:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:24,179 INFO L225 Difference]: With dead ends: 1239477 [2019-09-10 07:52:24,179 INFO L226 Difference]: Without dead ends: 1239477 [2019-09-10 07:52:24,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 236 SyntacticMatches, 21 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16351 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=7163, Invalid=38847, Unknown=0, NotChecked=0, Total=46010 [2019-09-10 07:52:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239477 states. [2019-09-10 07:52:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239477 to 335873. [2019-09-10 07:52:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335873 states. [2019-09-10 07:52:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335873 states to 335873 states and 411978 transitions. [2019-09-10 07:52:33,782 INFO L78 Accepts]: Start accepts. Automaton has 335873 states and 411978 transitions. Word has length 138 [2019-09-10 07:52:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:33,782 INFO L475 AbstractCegarLoop]: Abstraction has 335873 states and 411978 transitions. [2019-09-10 07:52:33,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:52:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 335873 states and 411978 transitions. [2019-09-10 07:52:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 07:52:33,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:33,806 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, 1, 1, 1, 1, 1, 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 07:52:33,806 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash -204578995, now seen corresponding path program 1 times [2019-09-10 07:52:33,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:33,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:33,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:38,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:38,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:38,012 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2019-09-10 07:52:38,012 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [306], [361], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1969], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:52:38,031 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:38,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:38,066 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:38,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:38,460 INFO L272 AbstractInterpreter]: Visited 130 different actions 561 times. Merged at 51 different actions 381 times. Widened at 18 different actions 47 times. Performed 2272 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 12 different actions. Largest state had 272 variables. [2019-09-10 07:52:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:38,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:38,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:38,461 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:38,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:38,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:52:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:38,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 07:52:38,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:38,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:38,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:38,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:38,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:39,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:40,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:40,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:40,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:52:40,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:40,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:52:40,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:52:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:52:40,227 INFO L87 Difference]: Start difference. First operand 335873 states and 411978 transitions. Second operand 20 states. [2019-09-10 07:52:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:49,821 INFO L93 Difference]: Finished difference Result 978547 states and 1188993 transitions. [2019-09-10 07:52:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 07:52:49,822 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-09-10 07:52:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:50,941 INFO L225 Difference]: With dead ends: 978547 [2019-09-10 07:52:50,941 INFO L226 Difference]: Without dead ends: 978547 [2019-09-10 07:52:50,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 239 SyntacticMatches, 20 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1350, Invalid=5456, Unknown=0, NotChecked=0, Total=6806 [2019-09-10 07:52:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978547 states. [2019-09-10 07:53:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978547 to 335840. [2019-09-10 07:53:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335840 states. [2019-09-10 07:53:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335840 states to 335840 states and 411944 transitions. [2019-09-10 07:53:04,176 INFO L78 Accepts]: Start accepts. Automaton has 335840 states and 411944 transitions. Word has length 139 [2019-09-10 07:53:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:04,176 INFO L475 AbstractCegarLoop]: Abstraction has 335840 states and 411944 transitions. [2019-09-10 07:53:04,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:53:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 335840 states and 411944 transitions. [2019-09-10 07:53:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:53:04,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:04,191 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, 1, 1, 1, 1, 1, 1, 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 07:53:04,191 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2129744109, now seen corresponding path program 1 times [2019-09-10 07:53:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:04,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:04,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:04,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:04,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:53:04,554 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1683], [1705], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1938], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:53:04,559 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:04,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:04,597 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:05,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:05,097 INFO L272 AbstractInterpreter]: Visited 131 different actions 513 times. Merged at 52 different actions 341 times. Widened at 13 different actions 24 times. Performed 2071 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2071 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:53:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:05,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:05,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:05,098 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:53:05,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:05,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:05,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-10 07:53:05,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:05,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:05,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:06,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:06,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:07,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:07,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2019-09-10 07:53:07,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:07,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:53:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:53:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:53:07,143 INFO L87 Difference]: Start difference. First operand 335840 states and 411944 transitions. Second operand 32 states. [2019-09-10 07:53:14,547 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-09-10 07:53:15,203 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-09-10 07:53:15,478 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:53:15,683 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-10 07:53:15,963 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:53:17,166 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 07:53:17,415 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:53:17,731 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:53:18,236 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:53:18,443 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:53:19,749 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:53:21,625 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:53:21,869 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:53:22,363 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:53:22,911 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:53:23,455 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:53:23,769 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:53:24,001 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 07:53:24,375 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:53:24,664 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-10 07:53:25,184 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-10 07:53:25,642 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:53:25,893 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-10 07:53:26,475 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:53:26,837 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:53:27,555 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:53:27,774 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 07:53:28,100 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 07:53:28,421 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 07:53:28,968 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-10 07:53:29,826 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:53:30,114 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 07:53:30,638 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:53:30,982 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-10 07:53:31,565 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 07:53:31,997 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 07:53:32,375 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 07:53:32,616 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 07:53:32,982 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 07:53:33,246 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-10 07:53:35,422 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:53:36,085 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:53:37,301 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:53:38,126 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 07:53:38,921 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-10 07:53:39,872 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-10 07:53:40,236 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:53:40,961 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:53:41,388 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-10 07:53:41,808 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:53:42,256 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:53:42,586 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:53:43,224 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:53:43,724 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 07:53:43,947 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-10 07:53:44,374 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 07:53:44,785 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 07:53:45,275 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-09-10 07:53:45,694 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 07:53:46,317 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-10 07:53:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:53:49,388 INFO L93 Difference]: Finished difference Result 1238624 states and 1499646 transitions. [2019-09-10 07:53:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-10 07:53:49,388 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 140 [2019-09-10 07:53:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:53:50,977 INFO L225 Difference]: With dead ends: 1238624 [2019-09-10 07:53:50,977 INFO L226 Difference]: Without dead ends: 1238624 [2019-09-10 07:53:50,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7755 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=4431, Invalid=22959, Unknown=0, NotChecked=0, Total=27390 [2019-09-10 07:53:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238624 states. [2019-09-10 07:54:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238624 to 478589. [2019-09-10 07:54:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478589 states. [2019-09-10 07:54:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478589 states to 478589 states and 585122 transitions. [2019-09-10 07:54:10,181 INFO L78 Accepts]: Start accepts. Automaton has 478589 states and 585122 transitions. Word has length 140 [2019-09-10 07:54:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:10,182 INFO L475 AbstractCegarLoop]: Abstraction has 478589 states and 585122 transitions. [2019-09-10 07:54:10,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:54:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 478589 states and 585122 transitions. [2019-09-10 07:54:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:54:10,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:10,200 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, 1, 1, 1, 1, 1, 1, 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 07:54:10,200 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash 640534835, now seen corresponding path program 1 times [2019-09-10 07:54:10,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:10,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:10,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:10,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:15,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:15,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:15,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:54:15,725 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1683], [1705], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1957], [1960], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:54:15,729 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:15,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:15,767 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:16,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:16,245 INFO L272 AbstractInterpreter]: Visited 131 different actions 611 times. Merged at 52 different actions 429 times. Widened at 15 different actions 51 times. Performed 2446 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 11 different actions. Largest state had 272 variables. [2019-09-10 07:54:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:16,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:16,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:16,245 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:16,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:16,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:54:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 07:54:16,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:16,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:17,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:18,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:54:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:19,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:19,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 41 [2019-09-10 07:54:19,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:19,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:54:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:54:19,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 07:54:19,393 INFO L87 Difference]: Start difference. First operand 478589 states and 585122 transitions. Second operand 28 states. [2019-09-10 07:54:21,274 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-10 07:54:24,054 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:54:24,921 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:54:26,101 WARN L188 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-09-10 07:54:31,593 WARN L188 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 07:54:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:34,106 INFO L93 Difference]: Finished difference Result 907360 states and 1106299 transitions. [2019-09-10 07:54:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 07:54:34,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 140 [2019-09-10 07:54:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:35,196 INFO L225 Difference]: With dead ends: 907360 [2019-09-10 07:54:35,197 INFO L226 Difference]: Without dead ends: 907360 [2019-09-10 07:54:35,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 242 SyntacticMatches, 14 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=558, Invalid=3474, Unknown=0, NotChecked=0, Total=4032 [2019-09-10 07:54:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907360 states. [2019-09-10 07:54:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907360 to 591191. [2019-09-10 07:54:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591191 states. [2019-09-10 07:54:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591191 states to 591191 states and 720200 transitions. [2019-09-10 07:54:58,151 INFO L78 Accepts]: Start accepts. Automaton has 591191 states and 720200 transitions. Word has length 140 [2019-09-10 07:54:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:54:58,152 INFO L475 AbstractCegarLoop]: Abstraction has 591191 states and 720200 transitions. [2019-09-10 07:54:58,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:54:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 591191 states and 720200 transitions. [2019-09-10 07:54:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:54:58,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:54:58,176 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, 1, 1, 1, 1, 1, 1, 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 07:54:58,176 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:54:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -512783187, now seen corresponding path program 1 times [2019-09-10 07:54:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:54:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:54:58,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:54:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:58,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:58,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:54:58,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:54:58,498 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1683], [1705], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1918], [1921], [1927], [1929], [1932], [1935], [1938], [1949], [1951], [1954], [1957], [1960], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:54:58,501 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:54:58,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:54:58,532 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:54:58,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:54:58,787 INFO L272 AbstractInterpreter]: Visited 131 different actions 520 times. Merged at 52 different actions 347 times. Widened at 13 different actions 28 times. Performed 2154 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 11 different actions. Largest state had 272 variables. [2019-09-10 07:54:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:54:58,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:54:58,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:54:58,788 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:54:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:54:58,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:54:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:54:59,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:54:59,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:54:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:59,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:54:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:54:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:54:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:54:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 26 [2019-09-10 07:54:59,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:54:59,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 07:54:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 07:54:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:54:59,594 INFO L87 Difference]: Start difference. First operand 591191 states and 720200 transitions. Second operand 22 states. [2019-09-10 07:55:01,221 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2019-09-10 07:55:01,355 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2019-09-10 07:55:01,514 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2019-09-10 07:55:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:05,449 INFO L93 Difference]: Finished difference Result 998071 states and 1212408 transitions. [2019-09-10 07:55:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:55:05,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2019-09-10 07:55:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:06,717 INFO L225 Difference]: With dead ends: 998071 [2019-09-10 07:55:06,717 INFO L226 Difference]: Without dead ends: 998071 [2019-09-10 07:55:06,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 266 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 07:55:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998071 states. [2019-09-10 07:55:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998071 to 680851. [2019-09-10 07:55:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680851 states. [2019-09-10 07:55:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680851 states to 680851 states and 829080 transitions. [2019-09-10 07:55:25,172 INFO L78 Accepts]: Start accepts. Automaton has 680851 states and 829080 transitions. Word has length 140 [2019-09-10 07:55:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:25,172 INFO L475 AbstractCegarLoop]: Abstraction has 680851 states and 829080 transitions. [2019-09-10 07:55:25,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 07:55:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 680851 states and 829080 transitions. [2019-09-10 07:55:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:55:25,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:25,200 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, 1, 1, 1, 1, 1, 1, 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 07:55:25,200 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash -444048187, now seen corresponding path program 1 times [2019-09-10 07:55:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:25,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:25,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:26,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:26,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:26,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:55:26,547 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [144], [193], [196], [201], [204], [208], [221], [223], [254], [258], [295], [298], [301], [306], [361], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1938], [1949], [1951], [1954], [1957], [1962], [1965], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:55:26,550 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:26,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:26,596 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:27,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:27,046 INFO L272 AbstractInterpreter]: Visited 131 different actions 502 times. Merged at 52 different actions 330 times. Widened at 10 different actions 20 times. Performed 2055 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2055 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 10 different actions. Largest state had 272 variables. [2019-09-10 07:55:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:27,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:27,047 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:27,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:27,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:27,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:55:27,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:27,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:27,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:35,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:35,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:35,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11, 11] total 45 [2019-09-10 07:55:35,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:35,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 07:55:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 07:55:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1840, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:55:35,694 INFO L87 Difference]: Start difference. First operand 680851 states and 829080 transitions. Second operand 37 states. [2019-09-10 07:55:35,985 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 07:55:37,253 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:55:37,517 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:55:37,755 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:55:37,959 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:55:38,168 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-10 07:55:38,806 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-09-10 07:55:40,533 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:55:40,828 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:55:41,818 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:55:42,100 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 58 [2019-09-10 07:55:42,301 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:55:42,553 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:55:43,078 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-09-10 07:55:43,414 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2019-09-10 07:55:43,853 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-09-10 07:55:44,013 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 07:55:44,492 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 07:55:44,652 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:55:45,695 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 07:55:46,102 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:55:46,269 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:55:46,681 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2019-09-10 07:55:46,919 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:55:47,749 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-09-10 07:55:48,280 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 07:55:49,095 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-09-10 07:55:49,380 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-09-10 07:55:49,815 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 07:55:50,054 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-09-10 07:55:50,685 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 07:55:51,475 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:55:51,742 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:55:52,121 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-09-10 07:55:52,782 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 07:55:53,283 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 07:55:53,618 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:55:54,010 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 07:55:54,377 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-10 07:55:54,611 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:55:55,040 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:55:55,411 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-10 07:55:55,641 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:55:55,924 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 07:55:56,657 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-09-10 07:55:56,983 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-09-10 07:55:57,408 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:55:57,970 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:55:58,757 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:55:59,148 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-09-10 07:55:59,851 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-10 07:56:00,372 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 07:56:00,652 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-09-10 07:56:01,256 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 07:56:01,671 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:56:02,020 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:02,679 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:56:02,953 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 07:56:03,796 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-10 07:56:04,614 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-09-10 07:56:04,961 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 07:56:05,850 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:56:06,163 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 07:56:07,207 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:56:07,461 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:56:08,018 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-10 07:56:08,217 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:56:09,007 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-09-10 07:56:09,390 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:56:10,046 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 07:56:10,281 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:56:10,553 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:10,764 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:11,157 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:56:11,407 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 07:56:11,633 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-10 07:56:11,996 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:56:12,478 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:56:12,862 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:56:13,294 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:56:13,512 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:56:13,776 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:56:14,123 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:56:14,344 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:14,649 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:56:15,036 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:56:15,389 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:56:15,553 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:56:15,820 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-10 07:56:16,557 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:56:16,766 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:56:17,031 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 07:56:17,242 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 07:56:17,769 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:56:17,998 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 07:56:18,211 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:56:18,449 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:56:18,736 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-09-10 07:56:18,955 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 07:56:19,226 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-10 07:56:19,492 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-10 07:56:19,901 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 07:56:20,193 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-09-10 07:56:20,656 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:56:20,910 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:56:21,169 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-09-10 07:56:21,389 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:56:21,675 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:56:22,295 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-10 07:56:22,617 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-09-10 07:56:22,889 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:56:23,100 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:56:23,538 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-09-10 07:56:23,865 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-09-10 07:56:24,227 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2019-09-10 07:56:24,633 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:56:24,933 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2019-09-10 07:56:25,317 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-09-10 07:56:25,977 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-09-10 07:56:26,203 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-10 07:56:26,473 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-09-10 07:56:26,776 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-09-10 07:56:27,116 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-09-10 07:56:29,411 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 07:56:29,763 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-09-10 07:56:30,094 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:56:30,298 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:56:30,626 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 07:56:30,880 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-09-10 07:56:31,395 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:56:31,954 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 07:56:32,165 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-09-10 07:56:32,481 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2019-09-10 07:56:32,688 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:32,956 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:56:33,194 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-10 07:56:33,700 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-09-10 07:56:34,219 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2019-09-10 07:56:34,470 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2019-09-10 07:56:34,904 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-09-10 07:56:35,213 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-09-10 07:56:35,390 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:56:35,544 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:56:36,167 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:36,346 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 07:56:36,761 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-10 07:56:36,974 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:37,761 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-09-10 07:56:38,075 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-09-10 07:56:38,407 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-09-10 07:56:38,841 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 68 [2019-09-10 07:56:39,545 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-10 07:56:39,839 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-09-10 07:56:40,148 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-09-10 07:56:40,911 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2019-09-10 07:56:41,248 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 07:56:41,688 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 07:56:42,369 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-09-10 07:56:42,583 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:56:43,198 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 07:56:43,451 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-09-10 07:56:43,716 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-09-10 07:56:44,113 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2019-09-10 07:56:44,710 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-09-10 07:56:44,951 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 07:56:45,289 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-09-10 07:56:45,843 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2019-09-10 07:56:46,029 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-10 07:56:46,376 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 07:56:46,605 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-10 07:56:46,916 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:56:47,313 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2019-09-10 07:56:47,544 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:56:47,882 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 07:56:48,074 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:56:48,373 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:48,787 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2019-09-10 07:56:49,118 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2019-09-10 07:56:49,360 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:50,417 WARN L188 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-09-10 07:56:50,572 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:56:50,802 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 07:56:51,094 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-09-10 07:56:51,516 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 07:56:51,755 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:56:52,020 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:56:52,358 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-09-10 07:56:52,650 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:56:52,978 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-09-10 07:56:53,635 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:56:53,870 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 07:56:54,804 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:56:55,071 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:56:55,407 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 07:56:55,685 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 07:56:56,299 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:56:56,565 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:56:56,793 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:56:56,984 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:56:57,337 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:56:57,594 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-09-10 07:56:57,820 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-09-10 07:56:58,141 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2019-09-10 07:56:58,340 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:56:58,629 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-09-10 07:56:58,826 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:56:59,093 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-10 07:56:59,294 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:56:59,528 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:56:59,999 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-09-10 07:57:00,250 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-09-10 07:57:00,498 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2019-09-10 07:57:00,769 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-09-10 07:57:00,987 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-09-10 07:57:01,272 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-09-10 07:57:01,517 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-10 07:57:02,169 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:57:02,706 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 07:57:03,257 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 07:57:06,860 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:57:07,509 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:57:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:10,732 INFO L93 Difference]: Finished difference Result 1936416 states and 2347532 transitions. [2019-09-10 07:57:10,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 354 states. [2019-09-10 07:57:10,732 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-09-10 07:57:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:14,950 INFO L225 Difference]: With dead ends: 1936416 [2019-09-10 07:57:14,950 INFO L226 Difference]: Without dead ends: 1936416 [2019-09-10 07:57:14,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 389 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61235 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=17397, Invalid=135093, Unknown=0, NotChecked=0, Total=152490 [2019-09-10 07:57:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936416 states. [2019-09-10 07:57:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936416 to 775364. [2019-09-10 07:57:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775364 states. [2019-09-10 07:57:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775364 states to 775364 states and 941337 transitions. [2019-09-10 07:57:45,696 INFO L78 Accepts]: Start accepts. Automaton has 775364 states and 941337 transitions. Word has length 140 [2019-09-10 07:57:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:57:45,696 INFO L475 AbstractCegarLoop]: Abstraction has 775364 states and 941337 transitions. [2019-09-10 07:57:45,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 07:57:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 775364 states and 941337 transitions. [2019-09-10 07:57:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:57:45,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:57:45,716 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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 07:57:45,716 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:57:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:57:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1334408066, now seen corresponding path program 1 times [2019-09-10 07:57:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:57:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:45,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:57:45,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:57:45,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:57:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:57:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:57:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:57:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:57:45,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:57:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:57:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:57:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:57:45,793 INFO L87 Difference]: Start difference. First operand 775364 states and 941337 transitions. Second operand 3 states. [2019-09-10 07:57:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:54,318 INFO L93 Difference]: Finished difference Result 674890 states and 801111 transitions. [2019-09-10 07:57:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:57:54,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 07:57:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:55,188 INFO L225 Difference]: With dead ends: 674890 [2019-09-10 07:57:55,188 INFO L226 Difference]: Without dead ends: 674890 [2019-09-10 07:57:55,188 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 07:57:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674890 states. [2019-09-10 07:58:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674890 to 674888. [2019-09-10 07:58:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674888 states. [2019-09-10 07:58:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674888 states to 674888 states and 801110 transitions. [2019-09-10 07:58:08,831 INFO L78 Accepts]: Start accepts. Automaton has 674888 states and 801110 transitions. Word has length 140 [2019-09-10 07:58:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:08,831 INFO L475 AbstractCegarLoop]: Abstraction has 674888 states and 801110 transitions. [2019-09-10 07:58:08,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:58:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 674888 states and 801110 transitions. [2019-09-10 07:58:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:58:08,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:08,844 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, 1, 1, 1, 1, 1, 1, 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 07:58:08,845 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 621020676, now seen corresponding path program 1 times [2019-09-10 07:58:08,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:08,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:08,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:08,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:16,846 WARN L188 SmtUtils]: Spent 7.74 s on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-09-10 07:58:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:17,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:17,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:17,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:58:17,150 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [146], [193], [196], [201], [204], [208], [221], [223], [252], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1916], [1927], [1929], [1932], [1935], [1940], [1943], [1949], [1951], [1954], [1957], [1960], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:58:17,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:17,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:17,189 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:17,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:17,604 INFO L272 AbstractInterpreter]: Visited 131 different actions 640 times. Merged at 52 different actions 454 times. Widened at 16 different actions 65 times. Performed 2509 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 50 fixpoints after 15 different actions. Largest state had 272 variables. [2019-09-10 07:58:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:17,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:17,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:17,604 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:17,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:17,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:17,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:58:17,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:18,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:58:18,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:58:18,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 30 [2019-09-10 07:58:18,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:58:18,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 07:58:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 07:58:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:58:18,574 INFO L87 Difference]: Start difference. First operand 674888 states and 801110 transitions. Second operand 25 states. [2019-09-10 07:58:18,815 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 07:58:21,282 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-09-10 07:58:22,207 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-10 07:58:22,950 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:58:25,635 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:58:25,966 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-09-10 07:58:26,273 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:58:26,414 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-09-10 07:58:28,851 WARN L188 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:58:29,038 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:58:29,532 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 07:58:30,535 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 07:58:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:58:33,763 INFO L93 Difference]: Finished difference Result 1234574 states and 1470642 transitions. [2019-09-10 07:58:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 07:58:34,940 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 140 [2019-09-10 07:58:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:58:36,434 INFO L225 Difference]: With dead ends: 1234574 [2019-09-10 07:58:36,434 INFO L226 Difference]: Without dead ends: 1234574 [2019-09-10 07:58:36,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 264 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=951, Invalid=4901, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 07:58:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234574 states. [2019-09-10 07:58:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234574 to 539773. [2019-09-10 07:58:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539773 states. [2019-09-10 07:58:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539773 states to 539773 states and 640338 transitions. [2019-09-10 07:58:53,824 INFO L78 Accepts]: Start accepts. Automaton has 539773 states and 640338 transitions. Word has length 140 [2019-09-10 07:58:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:58:53,825 INFO L475 AbstractCegarLoop]: Abstraction has 539773 states and 640338 transitions. [2019-09-10 07:58:53,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 07:58:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 539773 states and 640338 transitions. [2019-09-10 07:58:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:58:53,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:58:53,833 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, 1, 1, 1, 1, 1, 1, 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 07:58:53,833 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:58:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash -532297346, now seen corresponding path program 1 times [2019-09-10 07:58:53,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:58:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:53,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:53,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:58:53,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:58:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:58:54,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:54,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:58:54,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 07:58:54,257 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [82], [85], [89], [92], [95], [99], [102], [105], [109], [112], [115], [118], [122], [125], [128], [132], [135], [138], [141], [146], [193], [196], [201], [204], [208], [221], [223], [252], [254], [258], [295], [298], [301], [304], [363], [367], [1146], [1149], [1150], [1152], [1225], [1228], [1231], [1234], [1276], [1280], [1598], [1672], [1675], [1678], [1681], [1707], [1711], [1885], [1888], [1892], [1895], [1898], [1902], [1904], [1907], [1910], [1913], [1918], [1921], [1927], [1929], [1932], [1935], [1938], [1949], [1951], [1954], [1957], [1960], [1971], [1973], [1976], [1979], [1984], [1987], [1993], [1995], [1997], [2000], [2003], [2011], [2013], [2016], [2019], [2027], [2029], [2032], [2035], [2043], [2045], [2048], [2051], [2059], [2099], [2100], [2104], [2105], [2106] [2019-09-10 07:58:54,258 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:58:54,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:58:54,285 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:58:54,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:58:54,667 INFO L272 AbstractInterpreter]: Visited 131 different actions 722 times. Merged at 52 different actions 530 times. Widened at 16 different actions 88 times. Performed 2664 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2664 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 57 fixpoints after 13 different actions. Largest state had 272 variables. [2019-09-10 07:58:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:58:54,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:58:54,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:58:54,667 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:58:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:58:54,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:58:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:58:54,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-10 07:58:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:58:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:55,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:58:55,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms