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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:25:20,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:25:20,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:25:20,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:25:20,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:25:20,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:25:20,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:25:20,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:25:20,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:25:20,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:25:20,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:25:20,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:25:20,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:25:20,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:25:20,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:25:20,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:25:20,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:25:20,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:25:20,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:25:20,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:25:20,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:25:20,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:25:20,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:25:20,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:25:20,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:25:20,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:25:20,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:25:20,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:25:20,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:25:20,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:25:20,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:25:20,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:25:20,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:25:20,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:25:20,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:25:20,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:25:20,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:25:20,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:25:20,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:25:20,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:25:20,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:25:20,524 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 08:25:20,550 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:25:20,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:25:20,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:25:20,551 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:25:20,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:25:20,552 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:25:20,552 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:25:20,552 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:25:20,552 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:25:20,553 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:25:20,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:25:20,553 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:25:20,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:25:20,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:25:20,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:25:20,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:25:20,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:25:20,555 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:25:20,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:25:20,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:25:20,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:25:20,555 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:25:20,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:25:20,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:25:20,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:25:20,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:25:20,556 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:25:20,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:25:20,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:25:20,557 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:25:20,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:25:20,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:25:20,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:25:20,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:25:20,611 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:25:20,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-10 08:25:20,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98adfacc1/67ff9c3c2ff345828a22bfac76bfc2da/FLAG44c4c3628 [2019-09-10 08:25:21,701 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:25:21,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-10 08:25:21,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98adfacc1/67ff9c3c2ff345828a22bfac76bfc2da/FLAG44c4c3628 [2019-09-10 08:25:22,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98adfacc1/67ff9c3c2ff345828a22bfac76bfc2da [2019-09-10 08:25:22,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:25:22,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:25:22,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:25:22,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:25:22,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:25:22,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:25:22" (1/1) ... [2019-09-10 08:25:22,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f93532c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:22, skipping insertion in model container [2019-09-10 08:25:22,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:25:22" (1/1) ... [2019-09-10 08:25:22,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:25:22,441 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:25:25,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:25:25,502 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:25:27,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:25:27,440 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:25:27,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27 WrapperNode [2019-09-10 08:25:27,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:25:27,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:25:27,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:25:27,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:25:27,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (1/1) ... [2019-09-10 08:25:27,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:25:27,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:25:27,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:25:27,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:25:27,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (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 08:25:27,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:25:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:25:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:25:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:25:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:25:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:25:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:25:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:25:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:25:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:25:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:25:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:25:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:25:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:25:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:25:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:25:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:25:39,438 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:25:39,438 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:25:39,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:25:39 BoogieIcfgContainer [2019-09-10 08:25:39,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:25:39,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:25:39,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:25:39,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:25:39,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:25:22" (1/3) ... [2019-09-10 08:25:39,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87f5c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:25:39, skipping insertion in model container [2019-09-10 08:25:39,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:27" (2/3) ... [2019-09-10 08:25:39,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87f5c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:25:39, skipping insertion in model container [2019-09-10 08:25:39,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:25:39" (3/3) ... [2019-09-10 08:25:39,450 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2019-09-10 08:25:39,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:25:39,470 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-09-10 08:25:39,487 INFO L252 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-09-10 08:25:39,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:25:39,514 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:25:39,514 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:25:39,514 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:25:39,514 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:25:39,514 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:25:39,515 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:25:39,515 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:25:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states. [2019-09-10 08:25:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:25:39,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:39,638 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, 1] [2019-09-10 08:25:39,641 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1706611694, now seen corresponding path program 1 times [2019-09-10 08:25:39,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:40,990 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 08:25:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:40,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:40,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:41,016 INFO L87 Difference]: Start difference. First operand 5472 states. Second operand 5 states. [2019-09-10 08:25:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:48,881 INFO L93 Difference]: Finished difference Result 6455 states and 10766 transitions. [2019-09-10 08:25:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:48,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:25:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:48,940 INFO L225 Difference]: With dead ends: 6455 [2019-09-10 08:25:48,940 INFO L226 Difference]: Without dead ends: 6443 [2019-09-10 08:25:48,942 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 08:25:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-09-10 08:25:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 6170. [2019-09-10 08:25:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-09-10 08:25:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 8133 transitions. [2019-09-10 08:25:49,264 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 8133 transitions. Word has length 106 [2019-09-10 08:25:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:49,265 INFO L475 AbstractCegarLoop]: Abstraction has 6170 states and 8133 transitions. [2019-09-10 08:25:49,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 8133 transitions. [2019-09-10 08:25:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:25:49,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:49,279 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, 1] [2019-09-10 08:25:49,281 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1831821121, now seen corresponding path program 1 times [2019-09-10 08:25:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:49,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:49,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:49,683 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 08:25:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:49,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:49,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:49,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:49,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:49,688 INFO L87 Difference]: Start difference. First operand 6170 states and 8133 transitions. Second operand 5 states. [2019-09-10 08:25:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:53,199 INFO L93 Difference]: Finished difference Result 5175 states and 6912 transitions. [2019-09-10 08:25:53,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:53,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:25:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:53,225 INFO L225 Difference]: With dead ends: 5175 [2019-09-10 08:25:53,225 INFO L226 Difference]: Without dead ends: 5175 [2019-09-10 08:25:53,226 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 08:25:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2019-09-10 08:25:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5175. [2019-09-10 08:25:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5175 states. [2019-09-10 08:25:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 6912 transitions. [2019-09-10 08:25:53,443 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 6912 transitions. Word has length 106 [2019-09-10 08:25:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:53,446 INFO L475 AbstractCegarLoop]: Abstraction has 5175 states and 6912 transitions. [2019-09-10 08:25:53,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 6912 transitions. [2019-09-10 08:25:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:25:53,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:53,468 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, 1] [2019-09-10 08:25:53,469 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash -836602696, now seen corresponding path program 1 times [2019-09-10 08:25:53,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:53,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:53,954 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 08:25:53,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:53,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:53,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:53,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:53,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:53,962 INFO L87 Difference]: Start difference. First operand 5175 states and 6912 transitions. Second operand 5 states. [2019-09-10 08:25:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:57,614 INFO L93 Difference]: Finished difference Result 5047 states and 6766 transitions. [2019-09-10 08:25:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:57,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:25:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:57,642 INFO L225 Difference]: With dead ends: 5047 [2019-09-10 08:25:57,642 INFO L226 Difference]: Without dead ends: 5047 [2019-09-10 08:25:57,642 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 08:25:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2019-09-10 08:25:57,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2019-09-10 08:25:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-09-10 08:25:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6766 transitions. [2019-09-10 08:25:57,733 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6766 transitions. Word has length 106 [2019-09-10 08:25:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 5047 states and 6766 transitions. [2019-09-10 08:25:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6766 transitions. [2019-09-10 08:25:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:25:57,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:57,753 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, 1, 1, 1] [2019-09-10 08:25:57,753 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash 627581450, now seen corresponding path program 1 times [2019-09-10 08:25:57,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:57,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:57,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:58,137 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 08:25:58,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:58,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:58,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:58,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:58,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:58,140 INFO L87 Difference]: Start difference. First operand 5047 states and 6766 transitions. Second operand 5 states. [2019-09-10 08:26:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:00,647 INFO L93 Difference]: Finished difference Result 3808 states and 5139 transitions. [2019-09-10 08:26:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:00,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 08:26:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:00,665 INFO L225 Difference]: With dead ends: 3808 [2019-09-10 08:26:00,666 INFO L226 Difference]: Without dead ends: 3808 [2019-09-10 08:26:00,666 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 08:26:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2019-09-10 08:26:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3808. [2019-09-10 08:26:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3808 states. [2019-09-10 08:26:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5139 transitions. [2019-09-10 08:26:00,723 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5139 transitions. Word has length 108 [2019-09-10 08:26:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:00,724 INFO L475 AbstractCegarLoop]: Abstraction has 3808 states and 5139 transitions. [2019-09-10 08:26:00,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5139 transitions. [2019-09-10 08:26:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:26:00,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:00,732 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, 1, 1, 1, 1, 1] [2019-09-10 08:26:00,733 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -95068611, now seen corresponding path program 1 times [2019-09-10 08:26:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:00,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:00,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:00,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:00,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:01,083 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 08:26:01,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:01,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:01,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:01,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:01,087 INFO L87 Difference]: Start difference. First operand 3808 states and 5139 transitions. Second operand 5 states. [2019-09-10 08:26:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:02,978 INFO L93 Difference]: Finished difference Result 2776 states and 3768 transitions. [2019-09-10 08:26:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:02,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:26:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:02,993 INFO L225 Difference]: With dead ends: 2776 [2019-09-10 08:26:02,993 INFO L226 Difference]: Without dead ends: 2776 [2019-09-10 08:26:02,994 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 08:26:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-09-10 08:26:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2776. [2019-09-10 08:26:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2776 states. [2019-09-10 08:26:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3768 transitions. [2019-09-10 08:26:03,034 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3768 transitions. Word has length 110 [2019-09-10 08:26:03,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:03,034 INFO L475 AbstractCegarLoop]: Abstraction has 2776 states and 3768 transitions. [2019-09-10 08:26:03,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3768 transitions. [2019-09-10 08:26:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:26:03,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:03,041 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:03,041 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash -687550509, now seen corresponding path program 1 times [2019-09-10 08:26:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:03,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:03,337 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 08:26:03,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:03,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:03,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:03,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:03,340 INFO L87 Difference]: Start difference. First operand 2776 states and 3768 transitions. Second operand 5 states. [2019-09-10 08:26:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:04,873 INFO L93 Difference]: Finished difference Result 2555 states and 3483 transitions. [2019-09-10 08:26:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:04,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-10 08:26:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:04,897 INFO L225 Difference]: With dead ends: 2555 [2019-09-10 08:26:04,897 INFO L226 Difference]: Without dead ends: 2555 [2019-09-10 08:26:04,898 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 08:26:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-09-10 08:26:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-09-10 08:26:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-09-10 08:26:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3483 transitions. [2019-09-10 08:26:04,940 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3483 transitions. Word has length 112 [2019-09-10 08:26:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:04,946 INFO L475 AbstractCegarLoop]: Abstraction has 2555 states and 3483 transitions. [2019-09-10 08:26:04,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3483 transitions. [2019-09-10 08:26:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:26:04,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:04,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:04,961 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1363681434, now seen corresponding path program 1 times [2019-09-10 08:26:04,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:04,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:05,321 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 08:26:05,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:26:05,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:05,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:26:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:26:05,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:26:05,323 INFO L87 Difference]: Start difference. First operand 2555 states and 3483 transitions. Second operand 5 states. [2019-09-10 08:26:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:06,496 INFO L93 Difference]: Finished difference Result 1738 states and 2381 transitions. [2019-09-10 08:26:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:26:06,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-10 08:26:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:06,502 INFO L225 Difference]: With dead ends: 1738 [2019-09-10 08:26:06,502 INFO L226 Difference]: Without dead ends: 1738 [2019-09-10 08:26:06,502 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 08:26:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-10 08:26:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2019-09-10 08:26:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2381 transitions. [2019-09-10 08:26:06,525 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2381 transitions. Word has length 114 [2019-09-10 08:26:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:06,526 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2381 transitions. [2019-09-10 08:26:06,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:26:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2381 transitions. [2019-09-10 08:26:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:26:06,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:06,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:06,530 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1535694352, now seen corresponding path program 1 times [2019-09-10 08:26:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:06,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:06,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:07,156 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 08:26:07,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:07,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:07,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:07,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:07,159 INFO L87 Difference]: Start difference. First operand 1738 states and 2381 transitions. Second operand 9 states. [2019-09-10 08:26:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:10,550 INFO L93 Difference]: Finished difference Result 2823 states and 3887 transitions. [2019-09-10 08:26:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:26:10,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:26:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:10,557 INFO L225 Difference]: With dead ends: 2823 [2019-09-10 08:26:10,557 INFO L226 Difference]: Without dead ends: 2823 [2019-09-10 08:26:10,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:26:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-09-10 08:26:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1738. [2019-09-10 08:26:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2380 transitions. [2019-09-10 08:26:10,601 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2380 transitions. Word has length 116 [2019-09-10 08:26:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:10,601 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2380 transitions. [2019-09-10 08:26:10,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2380 transitions. [2019-09-10 08:26:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:26:10,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:10,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:10,611 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 949695184, now seen corresponding path program 1 times [2019-09-10 08:26:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:10,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:10,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:10,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:11,195 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 08:26:11,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:11,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:11,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:11,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:11,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:11,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:11,197 INFO L87 Difference]: Start difference. First operand 1738 states and 2380 transitions. Second operand 9 states. [2019-09-10 08:26:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:14,297 INFO L93 Difference]: Finished difference Result 2997 states and 4127 transitions. [2019-09-10 08:26:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:14,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-09-10 08:26:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:14,303 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:26:14,304 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:26:14,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:26:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:26:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2379 transitions. [2019-09-10 08:26:14,334 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2379 transitions. Word has length 116 [2019-09-10 08:26:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:14,334 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2379 transitions. [2019-09-10 08:26:14,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2379 transitions. [2019-09-10 08:26:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:26:14,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:14,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:14,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash -629906736, now seen corresponding path program 1 times [2019-09-10 08:26:14,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:14,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:14,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:14,729 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 08:26:14,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:26:14,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:14,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:26:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:26:14,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:26:14,732 INFO L87 Difference]: Start difference. First operand 1738 states and 2379 transitions. Second operand 8 states. [2019-09-10 08:26:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:17,196 INFO L93 Difference]: Finished difference Result 2280 states and 2997 transitions. [2019-09-10 08:26:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:26:17,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2019-09-10 08:26:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:17,203 INFO L225 Difference]: With dead ends: 2280 [2019-09-10 08:26:17,203 INFO L226 Difference]: Without dead ends: 2280 [2019-09-10 08:26:17,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:26:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-09-10 08:26:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1738. [2019-09-10 08:26:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2378 transitions. [2019-09-10 08:26:17,227 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2378 transitions. Word has length 116 [2019-09-10 08:26:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:17,227 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2378 transitions. [2019-09-10 08:26:17,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:26:17,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2378 transitions. [2019-09-10 08:26:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:26:17,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:17,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:26:17,231 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:17,232 INFO L82 PathProgramCache]: Analyzing trace with hash 757155627, now seen corresponding path program 1 times [2019-09-10 08:26:17,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:17,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:17,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:17,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:17,651 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 08:26:17,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:17,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:17,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:17,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:17,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:17,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:17,655 INFO L87 Difference]: Start difference. First operand 1738 states and 2378 transitions. Second operand 9 states. [2019-09-10 08:26:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:21,088 INFO L93 Difference]: Finished difference Result 2997 states and 4124 transitions. [2019-09-10 08:26:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:21,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:26:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:21,095 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:26:21,096 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:26:21,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:26:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:26:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2377 transitions. [2019-09-10 08:26:21,126 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2377 transitions. Word has length 117 [2019-09-10 08:26:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:21,127 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2377 transitions. [2019-09-10 08:26:21,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2377 transitions. [2019-09-10 08:26:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:26:21,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:21,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:21,131 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -762228437, now seen corresponding path program 1 times [2019-09-10 08:26:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:21,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:21,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:21,604 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 08:26:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:21,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:21,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:21,607 INFO L87 Difference]: Start difference. First operand 1738 states and 2377 transitions. Second operand 9 states. [2019-09-10 08:26:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:25,252 INFO L93 Difference]: Finished difference Result 3052 states and 4219 transitions. [2019-09-10 08:26:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:25,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2019-09-10 08:26:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:25,264 INFO L225 Difference]: With dead ends: 3052 [2019-09-10 08:26:25,264 INFO L226 Difference]: Without dead ends: 3052 [2019-09-10 08:26:25,265 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 08:26:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-10 08:26:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-10 08:26:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2376 transitions. [2019-09-10 08:26:25,294 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2376 transitions. Word has length 117 [2019-09-10 08:26:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:25,295 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2376 transitions. [2019-09-10 08:26:25,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2376 transitions. [2019-09-10 08:26:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:25,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:25,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:25,299 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1254114283, now seen corresponding path program 1 times [2019-09-10 08:26:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:25,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:25,654 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 08:26:25,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:25,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:25,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:25,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:25,656 INFO L87 Difference]: Start difference. First operand 1738 states and 2376 transitions. Second operand 9 states. [2019-09-10 08:26:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:28,969 INFO L93 Difference]: Finished difference Result 3052 states and 4217 transitions. [2019-09-10 08:26:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:28,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:28,974 INFO L225 Difference]: With dead ends: 3052 [2019-09-10 08:26:28,974 INFO L226 Difference]: Without dead ends: 3052 [2019-09-10 08:26:28,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-10 08:26:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-10 08:26:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2375 transitions. [2019-09-10 08:26:29,003 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2375 transitions. Word has length 118 [2019-09-10 08:26:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:29,004 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2375 transitions. [2019-09-10 08:26:29,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2019-09-10 08:26:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:29,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:29,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:29,010 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash 734100853, now seen corresponding path program 1 times [2019-09-10 08:26:29,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:29,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:29,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:29,417 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 08:26:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:29,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:29,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:29,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:29,419 INFO L87 Difference]: Start difference. First operand 1738 states and 2375 transitions. Second operand 9 states. [2019-09-10 08:26:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:32,746 INFO L93 Difference]: Finished difference Result 2997 states and 4120 transitions. [2019-09-10 08:26:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:32,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:32,751 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:26:32,751 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:26:32,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:26:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:26:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2374 transitions. [2019-09-10 08:26:32,777 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2374 transitions. Word has length 118 [2019-09-10 08:26:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:32,778 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2374 transitions. [2019-09-10 08:26:32,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2374 transitions. [2019-09-10 08:26:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:32,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:32,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:32,782 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash -148700306, now seen corresponding path program 1 times [2019-09-10 08:26:32,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:32,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:33,204 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 08:26:33,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:33,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:33,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:33,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:33,206 INFO L87 Difference]: Start difference. First operand 1738 states and 2374 transitions. Second operand 9 states. [2019-09-10 08:26:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:36,838 INFO L93 Difference]: Finished difference Result 3021 states and 4163 transitions. [2019-09-10 08:26:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:36,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:36,842 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:26:36,842 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:26:36,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:26:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:26:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2373 transitions. [2019-09-10 08:26:36,867 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2373 transitions. Word has length 118 [2019-09-10 08:26:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:36,867 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2373 transitions. [2019-09-10 08:26:36,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2373 transitions. [2019-09-10 08:26:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:36,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:36,871 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1180685042, now seen corresponding path program 1 times [2019-09-10 08:26:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:36,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:36,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:36,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:37,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:37,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:37,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:37,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:37,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:37,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:37,227 INFO L87 Difference]: Start difference. First operand 1738 states and 2373 transitions. Second operand 9 states. [2019-09-10 08:26:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:40,670 INFO L93 Difference]: Finished difference Result 2949 states and 4036 transitions. [2019-09-10 08:26:40,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:40,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:40,674 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:26:40,675 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:26:40,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:26:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:26:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:26:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2372 transitions. [2019-09-10 08:26:40,783 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2372 transitions. Word has length 118 [2019-09-10 08:26:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:40,783 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2372 transitions. [2019-09-10 08:26:40,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2372 transitions. [2019-09-10 08:26:40,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:40,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:40,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:40,788 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 312589973, now seen corresponding path program 1 times [2019-09-10 08:26:40,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:40,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:40,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:40,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:41,135 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 08:26:41,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:41,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:41,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:41,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:41,137 INFO L87 Difference]: Start difference. First operand 1738 states and 2372 transitions. Second operand 9 states. [2019-09-10 08:26:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:44,162 INFO L93 Difference]: Finished difference Result 2175 states and 3011 transitions. [2019-09-10 08:26:44,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:26:44,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:44,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:44,165 INFO L225 Difference]: With dead ends: 2175 [2019-09-10 08:26:44,166 INFO L226 Difference]: Without dead ends: 2175 [2019-09-10 08:26:44,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:26:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2019-09-10 08:26:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 1738. [2019-09-10 08:26:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2370 transitions. [2019-09-10 08:26:44,185 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2370 transitions. Word has length 118 [2019-09-10 08:26:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:44,185 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2370 transitions. [2019-09-10 08:26:44,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2370 transitions. [2019-09-10 08:26:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:44,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:44,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:44,189 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -981773131, now seen corresponding path program 1 times [2019-09-10 08:26:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:44,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:44,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:44,541 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 08:26:44,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:44,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:44,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:44,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:44,543 INFO L87 Difference]: Start difference. First operand 1738 states and 2370 transitions. Second operand 9 states. [2019-09-10 08:26:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:48,975 INFO L93 Difference]: Finished difference Result 3052 states and 4209 transitions. [2019-09-10 08:26:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:48,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:48,979 INFO L225 Difference]: With dead ends: 3052 [2019-09-10 08:26:48,980 INFO L226 Difference]: Without dead ends: 3052 [2019-09-10 08:26:48,980 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 08:26:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-10 08:26:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-10 08:26:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2368 transitions. [2019-09-10 08:26:48,998 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2368 transitions. Word has length 118 [2019-09-10 08:26:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:48,999 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2368 transitions. [2019-09-10 08:26:48,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2368 transitions. [2019-09-10 08:26:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:26:49,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:49,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:49,002 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash -701109227, now seen corresponding path program 1 times [2019-09-10 08:26:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:49,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:49,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:49,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:49,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:49,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:49,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:49,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:49,360 INFO L87 Difference]: Start difference. First operand 1738 states and 2368 transitions. Second operand 9 states. [2019-09-10 08:26:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:53,469 INFO L93 Difference]: Finished difference Result 3021 states and 4156 transitions. [2019-09-10 08:26:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:53,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-09-10 08:26:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:53,473 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:26:53,473 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:26:53,474 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 08:26:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:26:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:26:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2366 transitions. [2019-09-10 08:26:53,491 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2366 transitions. Word has length 118 [2019-09-10 08:26:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:53,492 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2366 transitions. [2019-09-10 08:26:53,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2366 transitions. [2019-09-10 08:26:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:26:53,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:53,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:53,495 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1607911290, now seen corresponding path program 1 times [2019-09-10 08:26:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:53,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:53,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:53,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:53,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:53,864 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 08:26:53,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:53,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:53,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:53,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:53,866 INFO L87 Difference]: Start difference. First operand 1738 states and 2366 transitions. Second operand 9 states. [2019-09-10 08:26:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:57,743 INFO L93 Difference]: Finished difference Result 2997 states and 4111 transitions. [2019-09-10 08:26:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:26:57,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:26:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:57,748 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:26:57,748 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:26:57,748 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 08:26:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:26:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:26:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:26:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2365 transitions. [2019-09-10 08:26:57,765 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2365 transitions. Word has length 119 [2019-09-10 08:26:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:57,765 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2365 transitions. [2019-09-10 08:26:57,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2365 transitions. [2019-09-10 08:26:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:26:57,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:57,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:57,768 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:57,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1929158234, now seen corresponding path program 1 times [2019-09-10 08:26:57,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:57,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:57,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:57,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:58,081 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 08:26:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:58,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:58,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:58,083 INFO L87 Difference]: Start difference. First operand 1738 states and 2365 transitions. Second operand 9 states. [2019-09-10 08:27:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:02,340 INFO L93 Difference]: Finished difference Result 3021 states and 4154 transitions. [2019-09-10 08:27:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:02,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:02,345 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:27:02,345 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:27:02,345 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 08:27:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:27:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:27:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2364 transitions. [2019-09-10 08:27:02,367 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2364 transitions. Word has length 119 [2019-09-10 08:27:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:02,367 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2364 transitions. [2019-09-10 08:27:02,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2364 transitions. [2019-09-10 08:27:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:02,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:02,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:02,370 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1180944774, now seen corresponding path program 1 times [2019-09-10 08:27:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:02,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:02,650 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 08:27:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:02,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:02,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:02,652 INFO L87 Difference]: Start difference. First operand 1738 states and 2364 transitions. Second operand 9 states. [2019-09-10 08:27:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:06,500 INFO L93 Difference]: Finished difference Result 2997 states and 4109 transitions. [2019-09-10 08:27:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:06,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:06,506 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:27:06,506 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:27:06,507 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 08:27:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:27:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:27:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2363 transitions. [2019-09-10 08:27:06,524 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2363 transitions. Word has length 119 [2019-09-10 08:27:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:06,525 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2363 transitions. [2019-09-10 08:27:06,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2363 transitions. [2019-09-10 08:27:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:06,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:06,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:06,527 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1976074246, now seen corresponding path program 1 times [2019-09-10 08:27:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:06,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:06,883 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 08:27:06,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:06,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:06,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:06,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:06,885 INFO L87 Difference]: Start difference. First operand 1738 states and 2363 transitions. Second operand 9 states. [2019-09-10 08:27:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:11,086 INFO L93 Difference]: Finished difference Result 3021 states and 4150 transitions. [2019-09-10 08:27:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:11,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:11,091 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:27:11,091 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:27:11,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:27:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:27:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2362 transitions. [2019-09-10 08:27:11,115 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2362 transitions. Word has length 119 [2019-09-10 08:27:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:11,115 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2362 transitions. [2019-09-10 08:27:11,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2362 transitions. [2019-09-10 08:27:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:11,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:11,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:11,118 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -419426619, now seen corresponding path program 1 times [2019-09-10 08:27:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:11,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:11,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:11,390 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 08:27:11,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:11,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:11,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:11,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:11,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:11,391 INFO L87 Difference]: Start difference. First operand 1738 states and 2362 transitions. Second operand 9 states. [2019-09-10 08:27:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:15,190 INFO L93 Difference]: Finished difference Result 2949 states and 4025 transitions. [2019-09-10 08:27:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:15,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:15,195 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:27:15,195 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:27:15,196 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 08:27:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:27:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:27:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2361 transitions. [2019-09-10 08:27:15,219 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2361 transitions. Word has length 119 [2019-09-10 08:27:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:15,220 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2361 transitions. [2019-09-10 08:27:15,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2361 transitions. [2019-09-10 08:27:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:15,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:15,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:15,223 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -991258011, now seen corresponding path program 1 times [2019-09-10 08:27:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:15,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:15,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:15,640 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 08:27:15,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:15,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:15,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:15,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:15,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:15,642 INFO L87 Difference]: Start difference. First operand 1738 states and 2361 transitions. Second operand 9 states. [2019-09-10 08:27:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:18,951 INFO L93 Difference]: Finished difference Result 2861 states and 3867 transitions. [2019-09-10 08:27:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:18,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:18,956 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:27:18,956 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:27:18,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:27:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:27:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2360 transitions. [2019-09-10 08:27:18,976 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2360 transitions. Word has length 119 [2019-09-10 08:27:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:18,976 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2360 transitions. [2019-09-10 08:27:18,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2360 transitions. [2019-09-10 08:27:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:27:18,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:18,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:18,979 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:18,980 INFO L82 PathProgramCache]: Analyzing trace with hash 342204934, now seen corresponding path program 1 times [2019-09-10 08:27:18,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:18,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:18,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:19,233 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 08:27:19,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:19,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:19,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:19,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:19,235 INFO L87 Difference]: Start difference. First operand 1738 states and 2360 transitions. Second operand 9 states. [2019-09-10 08:27:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:23,174 INFO L93 Difference]: Finished difference Result 2997 states and 4104 transitions. [2019-09-10 08:27:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:23,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2019-09-10 08:27:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:23,178 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:27:23,178 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:27:23,179 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 08:27:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:27:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:27:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2358 transitions. [2019-09-10 08:27:23,199 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2358 transitions. Word has length 119 [2019-09-10 08:27:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:23,199 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2358 transitions. [2019-09-10 08:27:23,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2358 transitions. [2019-09-10 08:27:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:23,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:27:23,201 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1920575674, now seen corresponding path program 1 times [2019-09-10 08:27:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:23,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:23,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:23,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:23,517 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 08:27:23,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:23,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:23,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:23,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:23,518 INFO L87 Difference]: Start difference. First operand 1738 states and 2358 transitions. Second operand 9 states. [2019-09-10 08:27:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:26,795 INFO L93 Difference]: Finished difference Result 2861 states and 3863 transitions. [2019-09-10 08:27:26,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:26,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:26,798 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:27:26,799 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:27:26,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:27:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:27:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2357 transitions. [2019-09-10 08:27:26,817 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2357 transitions. Word has length 120 [2019-09-10 08:27:26,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:26,818 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2357 transitions. [2019-09-10 08:27:26,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2357 transitions. [2019-09-10 08:27:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:26,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:26,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:26,820 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 414540794, now seen corresponding path program 1 times [2019-09-10 08:27:26,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:26,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:26,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:26,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:26,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:27,085 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 08:27:27,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:27,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:27,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:27,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:27,086 INFO L87 Difference]: Start difference. First operand 1738 states and 2357 transitions. Second operand 9 states. [2019-09-10 08:27:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:30,355 INFO L93 Difference]: Finished difference Result 2997 states and 4101 transitions. [2019-09-10 08:27:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:30,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:30,359 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:27:30,359 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:27:30,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:27:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:27:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2356 transitions. [2019-09-10 08:27:30,385 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2356 transitions. Word has length 120 [2019-09-10 08:27:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:30,385 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2356 transitions. [2019-09-10 08:27:30,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2356 transitions. [2019-09-10 08:27:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:30,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:30,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:30,388 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1568643994, now seen corresponding path program 1 times [2019-09-10 08:27:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:30,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:30,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:30,737 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 08:27:30,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:30,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:30,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:30,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:30,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:30,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:30,738 INFO L87 Difference]: Start difference. First operand 1738 states and 2356 transitions. Second operand 9 states. [2019-09-10 08:27:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:34,066 INFO L93 Difference]: Finished difference Result 2861 states and 3860 transitions. [2019-09-10 08:27:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:34,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:34,075 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:27:34,076 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:27:34,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:27:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:27:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2355 transitions. [2019-09-10 08:27:34,092 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2355 transitions. Word has length 120 [2019-09-10 08:27:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:34,092 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2355 transitions. [2019-09-10 08:27:34,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2355 transitions. [2019-09-10 08:27:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:34,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:34,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:34,096 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1610669011, now seen corresponding path program 1 times [2019-09-10 08:27:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:34,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:34,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:34,402 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 08:27:34,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:34,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:34,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:34,404 INFO L87 Difference]: Start difference. First operand 1738 states and 2355 transitions. Second operand 9 states. [2019-09-10 08:27:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:38,336 INFO L93 Difference]: Finished difference Result 2949 states and 4016 transitions. [2019-09-10 08:27:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:38,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:38,340 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:27:38,340 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:27:38,341 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 08:27:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:27:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:27:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2354 transitions. [2019-09-10 08:27:38,360 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2354 transitions. Word has length 120 [2019-09-10 08:27:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:38,361 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2354 transitions. [2019-09-10 08:27:38,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2354 transitions. [2019-09-10 08:27:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:38,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:38,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:38,364 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1051578547, now seen corresponding path program 1 times [2019-09-10 08:27:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:38,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:38,626 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 08:27:38,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:38,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:38,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:38,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:38,627 INFO L87 Difference]: Start difference. First operand 1738 states and 2354 transitions. Second operand 9 states. [2019-09-10 08:27:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:42,448 INFO L93 Difference]: Finished difference Result 2949 states and 4015 transitions. [2019-09-10 08:27:42,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:42,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:42,452 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:27:42,453 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:27:42,453 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 08:27:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:27:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:27:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2353 transitions. [2019-09-10 08:27:42,471 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2353 transitions. Word has length 120 [2019-09-10 08:27:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:42,472 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2353 transitions. [2019-09-10 08:27:42,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2353 transitions. [2019-09-10 08:27:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:42,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:42,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:42,474 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1898617875, now seen corresponding path program 1 times [2019-09-10 08:27:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:42,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:42,743 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 08:27:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:42,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:42,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:42,745 INFO L87 Difference]: Start difference. First operand 1738 states and 2353 transitions. Second operand 9 states. [2019-09-10 08:27:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:46,645 INFO L93 Difference]: Finished difference Result 2997 states and 4095 transitions. [2019-09-10 08:27:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:46,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:46,649 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:27:46,649 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:27:46,650 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 08:27:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:27:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:27:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2352 transitions. [2019-09-10 08:27:46,665 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2352 transitions. Word has length 120 [2019-09-10 08:27:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:46,666 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2352 transitions. [2019-09-10 08:27:46,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2352 transitions. [2019-09-10 08:27:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:46,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:46,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:46,668 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1831294950, now seen corresponding path program 1 times [2019-09-10 08:27:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:46,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:46,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:47,027 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 08:27:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:47,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:47,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:47,034 INFO L87 Difference]: Start difference. First operand 1738 states and 2352 transitions. Second operand 9 states. [2019-09-10 08:27:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:51,381 INFO L93 Difference]: Finished difference Result 3052 states and 4184 transitions. [2019-09-10 08:27:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:51,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:51,385 INFO L225 Difference]: With dead ends: 3052 [2019-09-10 08:27:51,386 INFO L226 Difference]: Without dead ends: 3052 [2019-09-10 08:27:51,386 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 08:27:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2019-09-10 08:27:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 1738. [2019-09-10 08:27:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2350 transitions. [2019-09-10 08:27:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2350 transitions. Word has length 120 [2019-09-10 08:27:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:51,402 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2350 transitions. [2019-09-10 08:27:51,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2350 transitions. [2019-09-10 08:27:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:51,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:51,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:51,404 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash -465405286, now seen corresponding path program 1 times [2019-09-10 08:27:51,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:51,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:51,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:51,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:51,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:51,670 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 08:27:51,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:51,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:51,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:51,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:51,672 INFO L87 Difference]: Start difference. First operand 1738 states and 2350 transitions. Second operand 9 states. [2019-09-10 08:27:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:55,046 INFO L93 Difference]: Finished difference Result 2861 states and 3851 transitions. [2019-09-10 08:27:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:55,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:55,051 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:27:55,051 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:27:55,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:27:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:27:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:27:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2348 transitions. [2019-09-10 08:27:55,066 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2348 transitions. Word has length 120 [2019-09-10 08:27:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:55,067 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2348 transitions. [2019-09-10 08:27:55,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2348 transitions. [2019-09-10 08:27:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:55,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:55,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:55,069 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -903457254, now seen corresponding path program 1 times [2019-09-10 08:27:55,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:55,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:55,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:55,343 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 08:27:55,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:55,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:55,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:55,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:55,344 INFO L87 Difference]: Start difference. First operand 1738 states and 2348 transitions. Second operand 9 states. [2019-09-10 08:27:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:27:58,831 INFO L93 Difference]: Finished difference Result 2997 states and 4087 transitions. [2019-09-10 08:27:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:27:58,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:27:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:27:58,835 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:27:58,836 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:27:58,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:27:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:27:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:27:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:27:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2346 transitions. [2019-09-10 08:27:58,853 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2346 transitions. Word has length 120 [2019-09-10 08:27:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:27:58,853 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2346 transitions. [2019-09-10 08:27:58,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:27:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2346 transitions. [2019-09-10 08:27:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:27:58,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:27:58,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:27:58,855 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:27:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:27:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash 348790202, now seen corresponding path program 1 times [2019-09-10 08:27:58,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:27:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:27:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:27:58,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:27:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:27:59,196 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 08:27:59,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:27:59,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:27:59,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:27:59,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:27:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:27:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:27:59,198 INFO L87 Difference]: Start difference. First operand 1738 states and 2346 transitions. Second operand 9 states. [2019-09-10 08:28:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:02,605 INFO L93 Difference]: Finished difference Result 2861 states and 3845 transitions. [2019-09-10 08:28:02,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:02,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:02,609 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:02,609 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:02,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2344 transitions. [2019-09-10 08:28:02,629 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2344 transitions. Word has length 120 [2019-09-10 08:28:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:02,629 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2344 transitions. [2019-09-10 08:28:02,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2344 transitions. [2019-09-10 08:28:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:02,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:02,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:02,632 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2082138234, now seen corresponding path program 1 times [2019-09-10 08:28:02,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:02,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:02,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:02,878 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 08:28:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:02,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:02,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:02,880 INFO L87 Difference]: Start difference. First operand 1738 states and 2344 transitions. Second operand 9 states. [2019-09-10 08:28:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:06,216 INFO L93 Difference]: Finished difference Result 2861 states and 3841 transitions. [2019-09-10 08:28:06,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:06,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:06,221 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:06,221 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:06,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2342 transitions. [2019-09-10 08:28:06,240 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2342 transitions. Word has length 120 [2019-09-10 08:28:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:06,240 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2342 transitions. [2019-09-10 08:28:06,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2342 transitions. [2019-09-10 08:28:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:06,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:06,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:28:06,243 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1500413926, now seen corresponding path program 1 times [2019-09-10 08:28:06,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:06,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:06,497 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 08:28:06,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:06,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:06,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:06,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:06,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:06,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:06,500 INFO L87 Difference]: Start difference. First operand 1738 states and 2342 transitions. Second operand 9 states. [2019-09-10 08:28:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:10,454 INFO L93 Difference]: Finished difference Result 3021 states and 4120 transitions. [2019-09-10 08:28:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:10,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:10,458 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:28:10,458 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:28:10,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:28:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:28:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2340 transitions. [2019-09-10 08:28:10,479 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2340 transitions. Word has length 120 [2019-09-10 08:28:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:10,479 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2340 transitions. [2019-09-10 08:28:10,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2340 transitions. [2019-09-10 08:28:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:10,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:10,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:10,482 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1689078298, now seen corresponding path program 1 times [2019-09-10 08:28:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:10,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:10,733 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 08:28:10,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:10,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:10,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:10,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:10,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:10,735 INFO L87 Difference]: Start difference. First operand 1738 states and 2340 transitions. Second operand 9 states. [2019-09-10 08:28:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:14,004 INFO L93 Difference]: Finished difference Result 2861 states and 3835 transitions. [2019-09-10 08:28:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:14,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:14,008 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:14,008 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:14,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2338 transitions. [2019-09-10 08:28:14,032 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2338 transitions. Word has length 120 [2019-09-10 08:28:14,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:14,033 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2338 transitions. [2019-09-10 08:28:14,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:14,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2338 transitions. [2019-09-10 08:28:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:28:14,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:14,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:14,036 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:14,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:14,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1888231326, now seen corresponding path program 1 times [2019-09-10 08:28:14,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:14,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:14,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:14,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:14,359 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 08:28:14,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:14,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:14,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:14,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:14,361 INFO L87 Difference]: Start difference. First operand 1738 states and 2338 transitions. Second operand 9 states. [2019-09-10 08:28:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:18,261 INFO L93 Difference]: Finished difference Result 2949 states and 3992 transitions. [2019-09-10 08:28:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:18,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-09-10 08:28:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:18,265 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:28:18,265 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:28:18,266 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 08:28:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:28:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:28:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2336 transitions. [2019-09-10 08:28:18,283 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2336 transitions. Word has length 120 [2019-09-10 08:28:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:18,283 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2336 transitions. [2019-09-10 08:28:18,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2336 transitions. [2019-09-10 08:28:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:18,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:18,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:18,285 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash -79841087, now seen corresponding path program 1 times [2019-09-10 08:28:18,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:18,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:18,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:18,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:18,553 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 08:28:18,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:18,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:18,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:18,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:18,555 INFO L87 Difference]: Start difference. First operand 1738 states and 2336 transitions. Second operand 9 states. [2019-09-10 08:28:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:22,357 INFO L93 Difference]: Finished difference Result 2997 states and 4072 transitions. [2019-09-10 08:28:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:22,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:22,361 INFO L225 Difference]: With dead ends: 2997 [2019-09-10 08:28:22,361 INFO L226 Difference]: Without dead ends: 2997 [2019-09-10 08:28:22,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-09-10 08:28:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1738. [2019-09-10 08:28:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2335 transitions. [2019-09-10 08:28:22,378 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2335 transitions. Word has length 121 [2019-09-10 08:28:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:22,378 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2335 transitions. [2019-09-10 08:28:22,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2335 transitions. [2019-09-10 08:28:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:22,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:22,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:22,381 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:22,381 INFO L82 PathProgramCache]: Analyzing trace with hash 489427169, now seen corresponding path program 1 times [2019-09-10 08:28:22,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:22,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:22,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:22,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:22,615 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 08:28:22,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:22,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:22,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:22,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:22,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:22,616 INFO L87 Difference]: Start difference. First operand 1738 states and 2335 transitions. Second operand 9 states. [2019-09-10 08:28:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:26,529 INFO L93 Difference]: Finished difference Result 2949 states and 3990 transitions. [2019-09-10 08:28:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:26,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:26,533 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:28:26,533 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:28:26,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:28:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:28:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2334 transitions. [2019-09-10 08:28:26,555 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2334 transitions. Word has length 121 [2019-09-10 08:28:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:26,555 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2334 transitions. [2019-09-10 08:28:26,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2334 transitions. [2019-09-10 08:28:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:26,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:26,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:26,558 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1272510785, now seen corresponding path program 1 times [2019-09-10 08:28:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:26,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:26,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:26,794 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 08:28:26,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:26,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:26,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:26,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:26,795 INFO L87 Difference]: Start difference. First operand 1738 states and 2334 transitions. Second operand 9 states. [2019-09-10 08:28:31,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:31,058 INFO L93 Difference]: Finished difference Result 3021 states and 4110 transitions. [2019-09-10 08:28:31,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:31,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:31,063 INFO L225 Difference]: With dead ends: 3021 [2019-09-10 08:28:31,063 INFO L226 Difference]: Without dead ends: 3021 [2019-09-10 08:28:31,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-10 08:28:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 1738. [2019-09-10 08:28:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2333 transitions. [2019-09-10 08:28:31,086 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2333 transitions. Word has length 121 [2019-09-10 08:28:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:31,086 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2333 transitions. [2019-09-10 08:28:31,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2333 transitions. [2019-09-10 08:28:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:31,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:31,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:31,089 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:31,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1708619935, now seen corresponding path program 1 times [2019-09-10 08:28:31,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:31,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,364 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 08:28:31,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:31,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:31,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:31,365 INFO L87 Difference]: Start difference. First operand 1738 states and 2333 transitions. Second operand 9 states. [2019-09-10 08:28:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:34,659 INFO L93 Difference]: Finished difference Result 2861 states and 3828 transitions. [2019-09-10 08:28:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:34,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:34,663 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:34,663 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:34,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2332 transitions. [2019-09-10 08:28:34,679 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2332 transitions. Word has length 121 [2019-09-10 08:28:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:34,679 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2332 transitions. [2019-09-10 08:28:34,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2332 transitions. [2019-09-10 08:28:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:34,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:34,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:34,681 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash 811094624, now seen corresponding path program 1 times [2019-09-10 08:28:34,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:34,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:34,923 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 08:28:34,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:34,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:34,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:34,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:34,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:34,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:34,924 INFO L87 Difference]: Start difference. First operand 1738 states and 2332 transitions. Second operand 9 states. [2019-09-10 08:28:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:38,191 INFO L93 Difference]: Finished difference Result 2861 states and 3827 transitions. [2019-09-10 08:28:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:38,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:38,195 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:38,195 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:38,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2331 transitions. [2019-09-10 08:28:38,210 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2331 transitions. Word has length 121 [2019-09-10 08:28:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:38,210 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2331 transitions. [2019-09-10 08:28:38,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2331 transitions. [2019-09-10 08:28:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:38,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:38,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:38,212 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -516460637, now seen corresponding path program 1 times [2019-09-10 08:28:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:38,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:38,440 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 08:28:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:38,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:38,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:38,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:38,441 INFO L87 Difference]: Start difference. First operand 1738 states and 2331 transitions. Second operand 9 states. [2019-09-10 08:28:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:42,405 INFO L93 Difference]: Finished difference Result 2949 states and 3986 transitions. [2019-09-10 08:28:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:42,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:42,409 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:28:42,409 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:28:42,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:28:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:28:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2330 transitions. [2019-09-10 08:28:42,424 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2330 transitions. Word has length 121 [2019-09-10 08:28:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:42,424 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2330 transitions. [2019-09-10 08:28:42,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2330 transitions. [2019-09-10 08:28:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:42,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:42,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:42,426 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1705722879, now seen corresponding path program 1 times [2019-09-10 08:28:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:42,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:42,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:42,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:42,708 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 08:28:42,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:42,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:42,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:42,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:42,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:42,710 INFO L87 Difference]: Start difference. First operand 1738 states and 2330 transitions. Second operand 9 states. [2019-09-10 08:28:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:45,947 INFO L93 Difference]: Finished difference Result 2861 states and 3824 transitions. [2019-09-10 08:28:45,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:45,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:45,951 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:45,951 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:45,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2329 transitions. [2019-09-10 08:28:45,967 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2329 transitions. Word has length 121 [2019-09-10 08:28:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:45,967 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2329 transitions. [2019-09-10 08:28:45,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2329 transitions. [2019-09-10 08:28:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:45,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:45,969 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:45,969 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2011964607, now seen corresponding path program 1 times [2019-09-10 08:28:45,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:45,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:45,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:45,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:46,203 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 08:28:46,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:46,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:46,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:46,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:46,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:46,204 INFO L87 Difference]: Start difference. First operand 1738 states and 2329 transitions. Second operand 9 states. [2019-09-10 08:28:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:49,447 INFO L93 Difference]: Finished difference Result 2861 states and 3822 transitions. [2019-09-10 08:28:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:49,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:49,451 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:49,451 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:49,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2328 transitions. [2019-09-10 08:28:49,468 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2328 transitions. Word has length 121 [2019-09-10 08:28:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:49,469 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2328 transitions. [2019-09-10 08:28:49,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2328 transitions. [2019-09-10 08:28:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:49,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:49,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:49,470 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash -358628288, now seen corresponding path program 1 times [2019-09-10 08:28:49,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:49,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:49,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 08:28:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:49,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:49,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:49,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:49,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:49,794 INFO L87 Difference]: Start difference. First operand 1738 states and 2328 transitions. Second operand 9 states. [2019-09-10 08:28:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:53,037 INFO L93 Difference]: Finished difference Result 2861 states and 3821 transitions. [2019-09-10 08:28:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:53,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:53,041 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:28:53,041 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:28:53,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:28:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:28:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:28:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2327 transitions. [2019-09-10 08:28:53,056 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2327 transitions. Word has length 121 [2019-09-10 08:28:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:53,057 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2327 transitions. [2019-09-10 08:28:53,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2327 transitions. [2019-09-10 08:28:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:53,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:53,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:53,059 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash -898485247, now seen corresponding path program 1 times [2019-09-10 08:28:53,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:53,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:53,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:53,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:53,284 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 08:28:53,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:53,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:53,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:53,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:53,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:53,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:53,285 INFO L87 Difference]: Start difference. First operand 1738 states and 2327 transitions. Second operand 9 states. [2019-09-10 08:28:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:57,235 INFO L93 Difference]: Finished difference Result 2949 states and 3980 transitions. [2019-09-10 08:28:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:57,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:28:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:57,239 INFO L225 Difference]: With dead ends: 2949 [2019-09-10 08:28:57,239 INFO L226 Difference]: Without dead ends: 2949 [2019-09-10 08:28:57,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:28:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-09-10 08:28:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1738. [2019-09-10 08:28:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:28:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2326 transitions. [2019-09-10 08:28:57,258 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2326 transitions. Word has length 121 [2019-09-10 08:28:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:57,258 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2326 transitions. [2019-09-10 08:28:57,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2326 transitions. [2019-09-10 08:28:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:28:57,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:57,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:57,261 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash -847780959, now seen corresponding path program 1 times [2019-09-10 08:28:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:57,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:57,507 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 08:28:57,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:57,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:57,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:57,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:57,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:57,508 INFO L87 Difference]: Start difference. First operand 1738 states and 2326 transitions. Second operand 9 states. [2019-09-10 08:29:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:00,789 INFO L93 Difference]: Finished difference Result 2861 states and 3818 transitions. [2019-09-10 08:29:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:00,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:00,793 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:29:00,793 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:29:00,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:29:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:29:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:29:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2325 transitions. [2019-09-10 08:29:00,814 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2325 transitions. Word has length 121 [2019-09-10 08:29:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:00,814 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2325 transitions. [2019-09-10 08:29:00,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2325 transitions. [2019-09-10 08:29:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:00,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:00,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:00,817 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -510563488, now seen corresponding path program 1 times [2019-09-10 08:29:00,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:01,103 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 08:29:01,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:01,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:01,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:01,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:01,104 INFO L87 Difference]: Start difference. First operand 1738 states and 2325 transitions. Second operand 9 states. [2019-09-10 08:29:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:04,790 INFO L93 Difference]: Finished difference Result 2861 states and 3817 transitions. [2019-09-10 08:29:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:04,791 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:04,795 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:29:04,795 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:29:04,795 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 08:29:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:29:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:29:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:29:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2324 transitions. [2019-09-10 08:29:04,810 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2324 transitions. Word has length 121 [2019-09-10 08:29:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:04,811 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2324 transitions. [2019-09-10 08:29:04,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2324 transitions. [2019-09-10 08:29:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:04,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:04,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:04,812 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash -667441760, now seen corresponding path program 1 times [2019-09-10 08:29:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:05,049 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 08:29:05,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:05,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:05,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:05,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:05,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:05,050 INFO L87 Difference]: Start difference. First operand 1738 states and 2324 transitions. Second operand 9 states. [2019-09-10 08:29:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:08,800 INFO L93 Difference]: Finished difference Result 2861 states and 3815 transitions. [2019-09-10 08:29:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:08,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:08,804 INFO L225 Difference]: With dead ends: 2861 [2019-09-10 08:29:08,804 INFO L226 Difference]: Without dead ends: 2861 [2019-09-10 08:29:08,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2019-09-10 08:29:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 1738. [2019-09-10 08:29:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1738 states. [2019-09-10 08:29:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2323 transitions. [2019-09-10 08:29:08,825 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2323 transitions. Word has length 121 [2019-09-10 08:29:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:08,825 INFO L475 AbstractCegarLoop]: Abstraction has 1738 states and 2323 transitions. [2019-09-10 08:29:08,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2323 transitions. [2019-09-10 08:29:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:08,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:08,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:08,828 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:08,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1389878040, now seen corresponding path program 1 times [2019-09-10 08:29:08,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:08,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:08,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:08,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:09,057 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 08:29:09,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:09,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:09,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:09,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:09,058 INFO L87 Difference]: Start difference. First operand 1738 states and 2323 transitions. Second operand 9 states. [2019-09-10 08:29:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:12,622 INFO L93 Difference]: Finished difference Result 2830 states and 3764 transitions. [2019-09-10 08:29:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:12,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:12,626 INFO L225 Difference]: With dead ends: 2830 [2019-09-10 08:29:12,626 INFO L226 Difference]: Without dead ends: 2830 [2019-09-10 08:29:12,626 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 08:29:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-09-10 08:29:12,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 1741. [2019-09-10 08:29:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2327 transitions. [2019-09-10 08:29:12,641 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2327 transitions. Word has length 121 [2019-09-10 08:29:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:12,642 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2327 transitions. [2019-09-10 08:29:12,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2327 transitions. [2019-09-10 08:29:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:12,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:12,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:12,644 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:12,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1633368833, now seen corresponding path program 1 times [2019-09-10 08:29:12,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:12,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,871 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 08:29:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:12,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:12,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:12,872 INFO L87 Difference]: Start difference. First operand 1741 states and 2327 transitions. Second operand 9 states. [2019-09-10 08:29:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:16,211 INFO L93 Difference]: Finished difference Result 2862 states and 3812 transitions. [2019-09-10 08:29:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:16,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:16,215 INFO L225 Difference]: With dead ends: 2862 [2019-09-10 08:29:16,215 INFO L226 Difference]: Without dead ends: 2862 [2019-09-10 08:29:16,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-10 08:29:16,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-10 08:29:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2325 transitions. [2019-09-10 08:29:16,232 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2325 transitions. Word has length 121 [2019-09-10 08:29:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:16,233 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2325 transitions. [2019-09-10 08:29:16,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2325 transitions. [2019-09-10 08:29:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:16,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:16,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:16,235 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1032824543, now seen corresponding path program 1 times [2019-09-10 08:29:16,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:16,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:16,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:16,485 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 08:29:16,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:16,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:16,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:16,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:16,486 INFO L87 Difference]: Start difference. First operand 1741 states and 2325 transitions. Second operand 9 states. [2019-09-10 08:29:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:20,451 INFO L93 Difference]: Finished difference Result 3000 states and 4056 transitions. [2019-09-10 08:29:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:20,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:20,455 INFO L225 Difference]: With dead ends: 3000 [2019-09-10 08:29:20,455 INFO L226 Difference]: Without dead ends: 3000 [2019-09-10 08:29:20,455 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 08:29:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-10 08:29:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-10 08:29:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2323 transitions. [2019-09-10 08:29:20,470 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2323 transitions. Word has length 121 [2019-09-10 08:29:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:20,470 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2323 transitions. [2019-09-10 08:29:20,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2323 transitions. [2019-09-10 08:29:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:20,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:20,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:20,472 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1566152575, now seen corresponding path program 1 times [2019-09-10 08:29:20,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:20,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:20,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:20,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:20,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:20,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:20,710 INFO L87 Difference]: Start difference. First operand 1741 states and 2323 transitions. Second operand 9 states. [2019-09-10 08:29:24,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:24,041 INFO L93 Difference]: Finished difference Result 2862 states and 3808 transitions. [2019-09-10 08:29:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:24,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:24,044 INFO L225 Difference]: With dead ends: 2862 [2019-09-10 08:29:24,044 INFO L226 Difference]: Without dead ends: 2862 [2019-09-10 08:29:24,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-10 08:29:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-10 08:29:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2321 transitions. [2019-09-10 08:29:24,059 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2321 transitions. Word has length 121 [2019-09-10 08:29:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:24,060 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2321 transitions. [2019-09-10 08:29:24,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2321 transitions. [2019-09-10 08:29:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:24,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:24,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:24,061 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1563798271, now seen corresponding path program 1 times [2019-09-10 08:29:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:24,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:24,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:24,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:24,284 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 08:29:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:24,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:24,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:24,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:24,286 INFO L87 Difference]: Start difference. First operand 1741 states and 2321 transitions. Second operand 9 states. [2019-09-10 08:29:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:28,487 INFO L93 Difference]: Finished difference Result 3024 states and 4093 transitions. [2019-09-10 08:29:28,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:28,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:28,491 INFO L225 Difference]: With dead ends: 3024 [2019-09-10 08:29:28,492 INFO L226 Difference]: Without dead ends: 3024 [2019-09-10 08:29:28,492 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 08:29:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2019-09-10 08:29:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 1741. [2019-09-10 08:29:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2319 transitions. [2019-09-10 08:29:28,509 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2319 transitions. Word has length 121 [2019-09-10 08:29:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:28,510 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2319 transitions. [2019-09-10 08:29:28,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2319 transitions. [2019-09-10 08:29:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:28,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:28,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:28,512 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:28,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1949660417, now seen corresponding path program 1 times [2019-09-10 08:29:28,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:28,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:28,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:28,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:28,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:28,755 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 08:29:28,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:28,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:28,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:28,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:28,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:28,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:28,756 INFO L87 Difference]: Start difference. First operand 1741 states and 2319 transitions. Second operand 9 states. [2019-09-10 08:29:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:32,643 INFO L93 Difference]: Finished difference Result 2952 states and 3970 transitions. [2019-09-10 08:29:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:32,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:32,646 INFO L225 Difference]: With dead ends: 2952 [2019-09-10 08:29:32,647 INFO L226 Difference]: Without dead ends: 2952 [2019-09-10 08:29:32,647 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 08:29:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-10 08:29:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-10 08:29:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2317 transitions. [2019-09-10 08:29:32,663 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2317 transitions. Word has length 121 [2019-09-10 08:29:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:32,663 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2317 transitions. [2019-09-10 08:29:32,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2317 transitions. [2019-09-10 08:29:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:32,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:32,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:29:32,665 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1068773343, now seen corresponding path program 1 times [2019-09-10 08:29:32,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:32,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:32,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:32,905 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 08:29:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:32,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:32,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:32,906 INFO L87 Difference]: Start difference. First operand 1741 states and 2317 transitions. Second operand 9 states. [2019-09-10 08:29:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:36,206 INFO L93 Difference]: Finished difference Result 2862 states and 3802 transitions. [2019-09-10 08:29:36,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:36,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:36,209 INFO L225 Difference]: With dead ends: 2862 [2019-09-10 08:29:36,209 INFO L226 Difference]: Without dead ends: 2862 [2019-09-10 08:29:36,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-10 08:29:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-10 08:29:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2315 transitions. [2019-09-10 08:29:36,225 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2315 transitions. Word has length 121 [2019-09-10 08:29:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:36,225 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2315 transitions. [2019-09-10 08:29:36,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2315 transitions. [2019-09-10 08:29:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:36,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:36,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:36,227 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash 636558369, now seen corresponding path program 1 times [2019-09-10 08:29:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:36,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:36,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:36,472 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 08:29:36,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:36,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:36,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:36,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:36,474 INFO L87 Difference]: Start difference. First operand 1741 states and 2315 transitions. Second operand 9 states. [2019-09-10 08:29:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:40,014 INFO L93 Difference]: Finished difference Result 3000 states and 4044 transitions. [2019-09-10 08:29:40,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:40,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:40,018 INFO L225 Difference]: With dead ends: 3000 [2019-09-10 08:29:40,018 INFO L226 Difference]: Without dead ends: 3000 [2019-09-10 08:29:40,019 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 08:29:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-10 08:29:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-10 08:29:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2313 transitions. [2019-09-10 08:29:40,034 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2313 transitions. Word has length 121 [2019-09-10 08:29:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:40,034 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2313 transitions. [2019-09-10 08:29:40,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2313 transitions. [2019-09-10 08:29:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:40,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:40,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:40,037 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1339146721, now seen corresponding path program 1 times [2019-09-10 08:29:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:40,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:40,383 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 08:29:40,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:40,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:40,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:40,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:40,385 INFO L87 Difference]: Start difference. First operand 1741 states and 2313 transitions. Second operand 9 states. [2019-09-10 08:29:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:44,046 INFO L93 Difference]: Finished difference Result 3000 states and 4040 transitions. [2019-09-10 08:29:44,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:44,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:44,051 INFO L225 Difference]: With dead ends: 3000 [2019-09-10 08:29:44,051 INFO L226 Difference]: Without dead ends: 3000 [2019-09-10 08:29:44,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-09-10 08:29:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1741. [2019-09-10 08:29:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2311 transitions. [2019-09-10 08:29:44,067 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2311 transitions. Word has length 121 [2019-09-10 08:29:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:44,067 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2311 transitions. [2019-09-10 08:29:44,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2311 transitions. [2019-09-10 08:29:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:44,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:44,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:44,070 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1642718527, now seen corresponding path program 1 times [2019-09-10 08:29:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:44,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:44,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:44,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:44,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:44,303 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 08:29:44,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:44,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:44,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:44,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:44,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:44,304 INFO L87 Difference]: Start difference. First operand 1741 states and 2311 transitions. Second operand 9 states. [2019-09-10 08:29:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:48,305 INFO L93 Difference]: Finished difference Result 2952 states and 3960 transitions. [2019-09-10 08:29:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:48,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:48,309 INFO L225 Difference]: With dead ends: 2952 [2019-09-10 08:29:48,309 INFO L226 Difference]: Without dead ends: 2952 [2019-09-10 08:29:48,309 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 08:29:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-10 08:29:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-10 08:29:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2309 transitions. [2019-09-10 08:29:48,324 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2309 transitions. Word has length 121 [2019-09-10 08:29:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:48,324 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2309 transitions. [2019-09-10 08:29:48,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2309 transitions. [2019-09-10 08:29:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:48,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:48,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:48,326 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1105224289, now seen corresponding path program 1 times [2019-09-10 08:29:48,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:48,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:48,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:48,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:48,561 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 08:29:48,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:48,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:48,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:48,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:48,563 INFO L87 Difference]: Start difference. First operand 1741 states and 2309 transitions. Second operand 9 states. [2019-09-10 08:29:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:52,599 INFO L93 Difference]: Finished difference Result 2952 states and 3956 transitions. [2019-09-10 08:29:52,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:52,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:52,603 INFO L225 Difference]: With dead ends: 2952 [2019-09-10 08:29:52,603 INFO L226 Difference]: Without dead ends: 2952 [2019-09-10 08:29:52,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:29:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-10 08:29:52,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-10 08:29:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2307 transitions. [2019-09-10 08:29:52,619 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2307 transitions. Word has length 121 [2019-09-10 08:29:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:52,620 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2307 transitions. [2019-09-10 08:29:52,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2307 transitions. [2019-09-10 08:29:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:29:52,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:52,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:52,622 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:52,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1880826624, now seen corresponding path program 1 times [2019-09-10 08:29:52,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:52,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:52,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:52,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:52,846 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 08:29:52,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:52,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:52,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:52,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:52,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:52,848 INFO L87 Difference]: Start difference. First operand 1741 states and 2307 transitions. Second operand 9 states. [2019-09-10 08:29:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:56,092 INFO L93 Difference]: Finished difference Result 2862 states and 3792 transitions. [2019-09-10 08:29:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:29:56,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-09-10 08:29:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:56,096 INFO L225 Difference]: With dead ends: 2862 [2019-09-10 08:29:56,096 INFO L226 Difference]: Without dead ends: 2862 [2019-09-10 08:29:56,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:29:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-09-10 08:29:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1741. [2019-09-10 08:29:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:29:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2305 transitions. [2019-09-10 08:29:56,111 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2305 transitions. Word has length 121 [2019-09-10 08:29:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:56,111 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2305 transitions. [2019-09-10 08:29:56,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2305 transitions. [2019-09-10 08:29:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:29:56,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:56,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:56,113 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2137513151, now seen corresponding path program 1 times [2019-09-10 08:29:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:56,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:56,350 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 08:29:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:56,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:56,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:56,351 INFO L87 Difference]: Start difference. First operand 1741 states and 2305 transitions. Second operand 9 states. [2019-09-10 08:30:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:00,337 INFO L93 Difference]: Finished difference Result 2952 states and 3952 transitions. [2019-09-10 08:30:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:00,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:00,341 INFO L225 Difference]: With dead ends: 2952 [2019-09-10 08:30:00,341 INFO L226 Difference]: Without dead ends: 2952 [2019-09-10 08:30:00,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2019-09-10 08:30:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1741. [2019-09-10 08:30:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-10 08:30:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2304 transitions. [2019-09-10 08:30:00,356 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2304 transitions. Word has length 122 [2019-09-10 08:30:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:00,357 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2304 transitions. [2019-09-10 08:30:00,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:00,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2304 transitions. [2019-09-10 08:30:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:00,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:00,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:00,359 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:00,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:00,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1004087310, now seen corresponding path program 1 times [2019-09-10 08:30:00,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:00,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:00,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:00,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:01,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 08:30:01,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:30:01,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:01,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:30:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:30:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:30:01,199 INFO L87 Difference]: Start difference. First operand 1741 states and 2304 transitions. Second operand 15 states. [2019-09-10 08:30:01,818 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:30:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:04,091 INFO L93 Difference]: Finished difference Result 1853 states and 2463 transitions. [2019-09-10 08:30:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:30:04,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 122 [2019-09-10 08:30:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:04,094 INFO L225 Difference]: With dead ends: 1853 [2019-09-10 08:30:04,094 INFO L226 Difference]: Without dead ends: 1853 [2019-09-10 08:30:04,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:30:04,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-09-10 08:30:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1527. [2019-09-10 08:30:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2016 transitions. [2019-09-10 08:30:04,106 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2016 transitions. Word has length 122 [2019-09-10 08:30:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:04,106 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2016 transitions. [2019-09-10 08:30:04,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:30:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2016 transitions. [2019-09-10 08:30:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:04,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:04,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:04,108 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2096009535, now seen corresponding path program 1 times [2019-09-10 08:30:04,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:04,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:04,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:04,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:04,489 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 08:30:04,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:04,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:04,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:04,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:04,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:04,491 INFO L87 Difference]: Start difference. First operand 1527 states and 2016 transitions. Second operand 9 states. [2019-09-10 08:30:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:07,724 INFO L93 Difference]: Finished difference Result 2676 states and 3595 transitions. [2019-09-10 08:30:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:07,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:07,727 INFO L225 Difference]: With dead ends: 2676 [2019-09-10 08:30:07,728 INFO L226 Difference]: Without dead ends: 2676 [2019-09-10 08:30:07,728 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 08:30:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-09-10 08:30:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1527. [2019-09-10 08:30:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2014 transitions. [2019-09-10 08:30:07,741 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2014 transitions. Word has length 122 [2019-09-10 08:30:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:07,741 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2014 transitions. [2019-09-10 08:30:07,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2014 transitions. [2019-09-10 08:30:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:07,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:07,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:07,743 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash -800294209, now seen corresponding path program 1 times [2019-09-10 08:30:07,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:07,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:07,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:07,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:08,103 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 08:30:08,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:08,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:08,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:08,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:08,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:08,104 INFO L87 Difference]: Start difference. First operand 1527 states and 2014 transitions. Second operand 9 states. [2019-09-10 08:30:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:10,831 INFO L93 Difference]: Finished difference Result 2556 states and 3384 transitions. [2019-09-10 08:30:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:10,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:10,835 INFO L225 Difference]: With dead ends: 2556 [2019-09-10 08:30:10,835 INFO L226 Difference]: Without dead ends: 2556 [2019-09-10 08:30:10,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-09-10 08:30:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1527. [2019-09-10 08:30:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2012 transitions. [2019-09-10 08:30:10,851 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2012 transitions. Word has length 122 [2019-09-10 08:30:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:10,851 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2012 transitions. [2019-09-10 08:30:10,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2012 transitions. [2019-09-10 08:30:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:10,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:10,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:10,853 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash 735327647, now seen corresponding path program 1 times [2019-09-10 08:30:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:10,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:11,208 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 08:30:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:11,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:11,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:11,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:11,209 INFO L87 Difference]: Start difference. First operand 1527 states and 2012 transitions. Second operand 9 states. [2019-09-10 08:30:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:14,456 INFO L93 Difference]: Finished difference Result 2696 states and 3621 transitions. [2019-09-10 08:30:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:14,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:14,460 INFO L225 Difference]: With dead ends: 2696 [2019-09-10 08:30:14,460 INFO L226 Difference]: Without dead ends: 2696 [2019-09-10 08:30:14,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-09-10 08:30:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 1527. [2019-09-10 08:30:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2010 transitions. [2019-09-10 08:30:14,477 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2010 transitions. Word has length 122 [2019-09-10 08:30:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:14,477 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2010 transitions. [2019-09-10 08:30:14,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2010 transitions. [2019-09-10 08:30:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:14,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:14,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:14,478 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 375676223, now seen corresponding path program 1 times [2019-09-10 08:30:14,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:14,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:14,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:14,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:14,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:14,830 INFO L87 Difference]: Start difference. First operand 1527 states and 2010 transitions. Second operand 9 states. [2019-09-10 08:30:17,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:17,816 INFO L93 Difference]: Finished difference Result 2636 states and 3521 transitions. [2019-09-10 08:30:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:17,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:17,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:17,820 INFO L225 Difference]: With dead ends: 2636 [2019-09-10 08:30:17,820 INFO L226 Difference]: Without dead ends: 2636 [2019-09-10 08:30:17,820 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 08:30:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-09-10 08:30:17,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 1527. [2019-09-10 08:30:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2008 transitions. [2019-09-10 08:30:17,834 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2008 transitions. Word has length 122 [2019-09-10 08:30:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:17,834 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2008 transitions. [2019-09-10 08:30:17,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2008 transitions. [2019-09-10 08:30:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:17,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:17,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:17,836 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1112977505, now seen corresponding path program 1 times [2019-09-10 08:30:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:17,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:17,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:18,188 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 08:30:18,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:18,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:18,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:18,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:18,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:18,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:18,190 INFO L87 Difference]: Start difference. First operand 1527 states and 2008 transitions. Second operand 9 states. [2019-09-10 08:30:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:21,568 INFO L93 Difference]: Finished difference Result 2676 states and 3583 transitions. [2019-09-10 08:30:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:21,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:21,572 INFO L225 Difference]: With dead ends: 2676 [2019-09-10 08:30:21,572 INFO L226 Difference]: Without dead ends: 2676 [2019-09-10 08:30:21,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2019-09-10 08:30:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1527. [2019-09-10 08:30:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2006 transitions. [2019-09-10 08:30:21,587 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2006 transitions. Word has length 122 [2019-09-10 08:30:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:21,587 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2006 transitions. [2019-09-10 08:30:21,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2006 transitions. [2019-09-10 08:30:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:21,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:21,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:21,589 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2118930561, now seen corresponding path program 1 times [2019-09-10 08:30:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:21,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:21,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:21,841 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 08:30:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:21,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:21,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:21,842 INFO L87 Difference]: Start difference. First operand 1527 states and 2006 transitions. Second operand 9 states. [2019-09-10 08:30:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:24,518 INFO L93 Difference]: Finished difference Result 2556 states and 3374 transitions. [2019-09-10 08:30:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:24,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:24,521 INFO L225 Difference]: With dead ends: 2556 [2019-09-10 08:30:24,522 INFO L226 Difference]: Without dead ends: 2556 [2019-09-10 08:30:24,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:30:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2019-09-10 08:30:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1527. [2019-09-10 08:30:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-09-10 08:30:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2004 transitions. [2019-09-10 08:30:24,537 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2004 transitions. Word has length 122 [2019-09-10 08:30:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:24,537 INFO L475 AbstractCegarLoop]: Abstraction has 1527 states and 2004 transitions. [2019-09-10 08:30:24,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2004 transitions. [2019-09-10 08:30:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:24,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:24,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:24,539 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 846547011, now seen corresponding path program 1 times [2019-09-10 08:30:24,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:24,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:24,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:24,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:24,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:24,893 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 08:30:24,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:24,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:24,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:24,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:24,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:24,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:24,894 INFO L87 Difference]: Start difference. First operand 1527 states and 2004 transitions. Second operand 9 states. [2019-09-10 08:30:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:27,849 INFO L93 Difference]: Finished difference Result 2554 states and 3370 transitions. [2019-09-10 08:30:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:27,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:27,853 INFO L225 Difference]: With dead ends: 2554 [2019-09-10 08:30:27,853 INFO L226 Difference]: Without dead ends: 2554 [2019-09-10 08:30:27,854 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 08:30:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2019-09-10 08:30:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1525. [2019-09-10 08:30:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2019-09-10 08:30:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2000 transitions. [2019-09-10 08:30:27,867 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2000 transitions. Word has length 122 [2019-09-10 08:30:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:27,867 INFO L475 AbstractCegarLoop]: Abstraction has 1525 states and 2000 transitions. [2019-09-10 08:30:27,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2000 transitions. [2019-09-10 08:30:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:27,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:27,868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:27,868 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash -354858205, now seen corresponding path program 1 times [2019-09-10 08:30:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:27,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:27,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:27,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:28,179 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 08:30:28,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:28,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:28,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:28,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:28,181 INFO L87 Difference]: Start difference. First operand 1525 states and 2000 transitions. Second operand 9 states. [2019-09-10 08:30:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:31,144 INFO L93 Difference]: Finished difference Result 2552 states and 3366 transitions. [2019-09-10 08:30:31,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:31,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:31,148 INFO L225 Difference]: With dead ends: 2552 [2019-09-10 08:30:31,148 INFO L226 Difference]: Without dead ends: 2552 [2019-09-10 08:30:31,148 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 08:30:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-09-10 08:30:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1523. [2019-09-10 08:30:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-09-10 08:30:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1996 transitions. [2019-09-10 08:30:31,161 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1996 transitions. Word has length 122 [2019-09-10 08:30:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:31,161 INFO L475 AbstractCegarLoop]: Abstraction has 1523 states and 1996 transitions. [2019-09-10 08:30:31,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1996 transitions. [2019-09-10 08:30:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:31,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:31,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:31,163 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash -594944765, now seen corresponding path program 1 times [2019-09-10 08:30:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:31,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:31,457 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 08:30:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:31,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:31,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:31,458 INFO L87 Difference]: Start difference. First operand 1523 states and 1996 transitions. Second operand 9 states. [2019-09-10 08:30:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:34,593 INFO L93 Difference]: Finished difference Result 2550 states and 3362 transitions. [2019-09-10 08:30:34,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:34,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:34,596 INFO L225 Difference]: With dead ends: 2550 [2019-09-10 08:30:34,596 INFO L226 Difference]: Without dead ends: 2550 [2019-09-10 08:30:34,596 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 08:30:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-09-10 08:30:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 1521. [2019-09-10 08:30:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-09-10 08:30:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1992 transitions. [2019-09-10 08:30:34,609 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1992 transitions. Word has length 122 [2019-09-10 08:30:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:34,610 INFO L475 AbstractCegarLoop]: Abstraction has 1521 states and 1992 transitions. [2019-09-10 08:30:34,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1992 transitions. [2019-09-10 08:30:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:34,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:34,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:34,611 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1366680803, now seen corresponding path program 1 times [2019-09-10 08:30:34,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:34,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:34,845 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 08:30:34,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:34,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:30:34,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:34,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:30:34,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:30:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:30:34,846 INFO L87 Difference]: Start difference. First operand 1521 states and 1992 transitions. Second operand 9 states. [2019-09-10 08:30:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:37,896 INFO L93 Difference]: Finished difference Result 2546 states and 3354 transitions. [2019-09-10 08:30:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:30:37,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-09-10 08:30:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:37,901 INFO L225 Difference]: With dead ends: 2546 [2019-09-10 08:30:37,902 INFO L226 Difference]: Without dead ends: 2546 [2019-09-10 08:30:37,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-09-10 08:30:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1519. [2019-09-10 08:30:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-09-10 08:30:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1988 transitions. [2019-09-10 08:30:37,924 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1988 transitions. Word has length 122 [2019-09-10 08:30:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:37,925 INFO L475 AbstractCegarLoop]: Abstraction has 1519 states and 1988 transitions. [2019-09-10 08:30:37,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:30:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1988 transitions. [2019-09-10 08:30:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-10 08:30:37,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:37,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:37,927 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1203155243, now seen corresponding path program 1 times [2019-09-10 08:30:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:37,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:39,321 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 08:30:39,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:39,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:30:39,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:39,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:30:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:30:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:39,322 INFO L87 Difference]: Start difference. First operand 1519 states and 1988 transitions. Second operand 21 states. [2019-09-10 08:30:40,537 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:30:40,869 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-09-10 08:30:41,038 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:30:41,194 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:30:41,357 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-10 08:30:41,702 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:30:42,206 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:30:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:50,820 INFO L93 Difference]: Finished difference Result 3528 states and 4606 transitions. [2019-09-10 08:30:50,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:30:50,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 122 [2019-09-10 08:30:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:50,825 INFO L225 Difference]: With dead ends: 3528 [2019-09-10 08:30:50,825 INFO L226 Difference]: Without dead ends: 3528 [2019-09-10 08:30:50,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=357, Invalid=1125, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:30:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-09-10 08:30:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 1519. [2019-09-10 08:30:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2019-09-10 08:30:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1986 transitions. [2019-09-10 08:30:50,841 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1986 transitions. Word has length 122 [2019-09-10 08:30:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:50,841 INFO L475 AbstractCegarLoop]: Abstraction has 1519 states and 1986 transitions. [2019-09-10 08:30:50,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:30:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1986 transitions. [2019-09-10 08:30:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:30:50,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:50,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:30:50,843 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash 610152284, now seen corresponding path program 1 times [2019-09-10 08:30:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:50,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:51,774 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 08:30:51,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:30:51,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:51,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:30:51,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:30:51,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:30:51,776 INFO L87 Difference]: Start difference. First operand 1519 states and 1986 transitions. Second operand 15 states. [2019-09-10 08:30:52,523 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 08:30:52,666 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 08:30:52,798 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-10 08:30:52,949 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-10 08:30:54,521 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 08:30:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:30:55,465 INFO L93 Difference]: Finished difference Result 4426 states and 6086 transitions. [2019-09-10 08:30:55,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:30:55,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2019-09-10 08:30:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:30:55,471 INFO L225 Difference]: With dead ends: 4426 [2019-09-10 08:30:55,472 INFO L226 Difference]: Without dead ends: 4426 [2019-09-10 08:30:55,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:30:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2019-09-10 08:30:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 1411. [2019-09-10 08:30:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:30:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1840 transitions. [2019-09-10 08:30:55,558 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1840 transitions. Word has length 123 [2019-09-10 08:30:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:55,558 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1840 transitions. [2019-09-10 08:30:55,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:30:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1840 transitions. [2019-09-10 08:30:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:30:55,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:55,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:55,559 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2142390268, now seen corresponding path program 1 times [2019-09-10 08:30:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:55,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:56,446 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 08:30:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:30:56,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:30:56,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:30:56,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:30:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:30:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:30:56,447 INFO L87 Difference]: Start difference. First operand 1411 states and 1840 transitions. Second operand 17 states. [2019-09-10 08:30:57,238 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:31:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:02,236 INFO L93 Difference]: Finished difference Result 2674 states and 3531 transitions. [2019-09-10 08:31:02,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:31:02,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2019-09-10 08:31:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:02,240 INFO L225 Difference]: With dead ends: 2674 [2019-09-10 08:31:02,240 INFO L226 Difference]: Without dead ends: 2674 [2019-09-10 08:31:02,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:31:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-09-10 08:31:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 1411. [2019-09-10 08:31:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1838 transitions. [2019-09-10 08:31:02,254 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1838 transitions. Word has length 123 [2019-09-10 08:31:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:02,254 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1838 transitions. [2019-09-10 08:31:02,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:31:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1838 transitions. [2019-09-10 08:31:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:02,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:02,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:02,256 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1464540668, now seen corresponding path program 1 times [2019-09-10 08:31:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:02,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:02,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 08:31:02,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:02,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:02,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:02,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:02,626 INFO L87 Difference]: Start difference. First operand 1411 states and 1838 transitions. Second operand 9 states. [2019-09-10 08:31:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:05,014 INFO L93 Difference]: Finished difference Result 2392 states and 3146 transitions. [2019-09-10 08:31:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:05,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:05,018 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:05,018 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:05,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:05,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1836 transitions. [2019-09-10 08:31:05,031 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1836 transitions. Word has length 123 [2019-09-10 08:31:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:05,031 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1836 transitions. [2019-09-10 08:31:05,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1836 transitions. [2019-09-10 08:31:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:05,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:05,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:05,033 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894972, now seen corresponding path program 1 times [2019-09-10 08:31:05,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:05,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:05,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:05,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:05,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:05,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:05,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:05,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:05,359 INFO L87 Difference]: Start difference. First operand 1411 states and 1836 transitions. Second operand 9 states. [2019-09-10 08:31:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:08,214 INFO L93 Difference]: Finished difference Result 2464 states and 3273 transitions. [2019-09-10 08:31:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:08,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:08,217 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:08,217 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:08,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1834 transitions. [2019-09-10 08:31:08,230 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1834 transitions. Word has length 123 [2019-09-10 08:31:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:08,231 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1834 transitions. [2019-09-10 08:31:08,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1834 transitions. [2019-09-10 08:31:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:08,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:08,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:08,232 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash 512953916, now seen corresponding path program 1 times [2019-09-10 08:31:08,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:08,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:08,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:08,556 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 08:31:08,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:08,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:08,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:08,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:08,558 INFO L87 Difference]: Start difference. First operand 1411 states and 1834 transitions. Second operand 9 states. [2019-09-10 08:31:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:11,553 INFO L93 Difference]: Finished difference Result 2464 states and 3271 transitions. [2019-09-10 08:31:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:11,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:11,557 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:11,557 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:11,557 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 08:31:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1832 transitions. [2019-09-10 08:31:11,571 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1832 transitions. Word has length 123 [2019-09-10 08:31:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:11,571 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1832 transitions. [2019-09-10 08:31:11,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1832 transitions. [2019-09-10 08:31:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:11,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:11,572 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:31:11,572 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 725577756, now seen corresponding path program 1 times [2019-09-10 08:31:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:11,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:11,801 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 08:31:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:11,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:11,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:11,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:11,802 INFO L87 Difference]: Start difference. First operand 1411 states and 1832 transitions. Second operand 9 states. [2019-09-10 08:31:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:14,610 INFO L93 Difference]: Finished difference Result 2464 states and 3267 transitions. [2019-09-10 08:31:14,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:14,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:14,614 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:14,614 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:14,614 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 08:31:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1830 transitions. [2019-09-10 08:31:14,628 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1830 transitions. Word has length 123 [2019-09-10 08:31:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:14,628 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1830 transitions. [2019-09-10 08:31:14,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1830 transitions. [2019-09-10 08:31:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:14,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:14,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:14,629 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:14,630 INFO L82 PathProgramCache]: Analyzing trace with hash 723223452, now seen corresponding path program 1 times [2019-09-10 08:31:14,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:14,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:14,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:14,939 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 08:31:14,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:14,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:14,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:14,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:14,940 INFO L87 Difference]: Start difference. First operand 1411 states and 1830 transitions. Second operand 9 states. [2019-09-10 08:31:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:17,323 INFO L93 Difference]: Finished difference Result 2392 states and 3138 transitions. [2019-09-10 08:31:17,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:17,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:17,326 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:17,327 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:17,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1828 transitions. [2019-09-10 08:31:17,341 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1828 transitions. Word has length 123 [2019-09-10 08:31:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:17,341 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1828 transitions. [2019-09-10 08:31:17,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1828 transitions. [2019-09-10 08:31:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:17,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:17,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:17,343 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1484213154, now seen corresponding path program 1 times [2019-09-10 08:31:17,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:17,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:17,592 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 08:31:17,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:17,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:17,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:17,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:17,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:17,594 INFO L87 Difference]: Start difference. First operand 1411 states and 1828 transitions. Second operand 9 states. [2019-09-10 08:31:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:20,234 INFO L93 Difference]: Finished difference Result 2392 states and 3136 transitions. [2019-09-10 08:31:20,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:20,234 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:20,237 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:20,237 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:20,238 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 08:31:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1826 transitions. [2019-09-10 08:31:20,251 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1826 transitions. Word has length 123 [2019-09-10 08:31:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:20,251 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1826 transitions. [2019-09-10 08:31:20,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1826 transitions. [2019-09-10 08:31:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:20,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:20,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:20,253 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 351435036, now seen corresponding path program 1 times [2019-09-10 08:31:20,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:20,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:20,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:20,493 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 08:31:20,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:20,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:20,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:20,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:20,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:20,494 INFO L87 Difference]: Start difference. First operand 1411 states and 1826 transitions. Second operand 9 states. [2019-09-10 08:31:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:23,329 INFO L93 Difference]: Finished difference Result 2464 states and 3259 transitions. [2019-09-10 08:31:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:23,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:23,333 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:23,334 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:23,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1824 transitions. [2019-09-10 08:31:23,347 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1824 transitions. Word has length 123 [2019-09-10 08:31:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:23,347 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1824 transitions. [2019-09-10 08:31:23,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1824 transitions. [2019-09-10 08:31:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:23,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:23,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:23,349 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:23,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1840849116, now seen corresponding path program 1 times [2019-09-10 08:31:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:23,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:23,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:23,652 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 08:31:23,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:23,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:23,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:23,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:23,654 INFO L87 Difference]: Start difference. First operand 1411 states and 1824 transitions. Second operand 9 states. [2019-09-10 08:31:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:26,035 INFO L93 Difference]: Finished difference Result 2392 states and 3132 transitions. [2019-09-10 08:31:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:26,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:26,038 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:26,038 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:26,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1822 transitions. [2019-09-10 08:31:26,056 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1822 transitions. Word has length 123 [2019-09-10 08:31:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:26,056 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1822 transitions. [2019-09-10 08:31:26,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1822 transitions. [2019-09-10 08:31:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:26,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:26,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:26,059 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash -748786468, now seen corresponding path program 1 times [2019-09-10 08:31:26,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:26,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:26,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:26,303 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 08:31:26,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:26,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:26,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:26,305 INFO L87 Difference]: Start difference. First operand 1411 states and 1822 transitions. Second operand 9 states. [2019-09-10 08:31:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:29,223 INFO L93 Difference]: Finished difference Result 2464 states and 3255 transitions. [2019-09-10 08:31:29,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:29,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:29,226 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:29,226 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:29,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1820 transitions. [2019-09-10 08:31:29,240 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1820 transitions. Word has length 123 [2019-09-10 08:31:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:29,240 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1820 transitions. [2019-09-10 08:31:29,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1820 transitions. [2019-09-10 08:31:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:29,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:29,241 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:31:29,241 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1652539044, now seen corresponding path program 1 times [2019-09-10 08:31:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:29,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:29,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:29,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:29,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:29,466 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 08:31:29,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:29,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:29,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:29,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:29,467 INFO L87 Difference]: Start difference. First operand 1411 states and 1820 transitions. Second operand 9 states. [2019-09-10 08:31:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:32,387 INFO L93 Difference]: Finished difference Result 2464 states and 3251 transitions. [2019-09-10 08:31:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:32,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:32,391 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:32,391 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:32,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1818 transitions. [2019-09-10 08:31:32,404 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1818 transitions. Word has length 123 [2019-09-10 08:31:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:32,404 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1818 transitions. [2019-09-10 08:31:32,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1818 transitions. [2019-09-10 08:31:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:32,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:32,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:32,406 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 404740092, now seen corresponding path program 1 times [2019-09-10 08:31:32,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:32,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:32,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:32,723 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 08:31:32,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:32,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:32,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:32,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:32,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:32,724 INFO L87 Difference]: Start difference. First operand 1411 states and 1818 transitions. Second operand 9 states. [2019-09-10 08:31:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:35,603 INFO L93 Difference]: Finished difference Result 2392 states and 3124 transitions. [2019-09-10 08:31:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:35,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:35,607 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:35,607 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:35,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1816 transitions. [2019-09-10 08:31:35,623 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1816 transitions. Word has length 123 [2019-09-10 08:31:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:35,623 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1816 transitions. [2019-09-10 08:31:35,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1816 transitions. [2019-09-10 08:31:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:35,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:35,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:35,625 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1162964388, now seen corresponding path program 1 times [2019-09-10 08:31:35,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:35,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:35,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:35,866 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 08:31:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:35,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:35,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:35,867 INFO L87 Difference]: Start difference. First operand 1411 states and 1816 transitions. Second operand 9 states. [2019-09-10 08:31:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:38,639 INFO L93 Difference]: Finished difference Result 2392 states and 3120 transitions. [2019-09-10 08:31:38,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:38,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:38,643 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:38,643 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:38,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:31:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1814 transitions. [2019-09-10 08:31:38,657 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1814 transitions. Word has length 123 [2019-09-10 08:31:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:38,657 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1814 transitions. [2019-09-10 08:31:38,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1814 transitions. [2019-09-10 08:31:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:38,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:38,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:38,658 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:38,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1074723772, now seen corresponding path program 1 times [2019-09-10 08:31:38,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:38,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:38,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:38,888 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 08:31:38,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:38,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:38,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:38,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:38,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:38,889 INFO L87 Difference]: Start difference. First operand 1411 states and 1814 transitions. Second operand 9 states. [2019-09-10 08:31:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:41,701 INFO L93 Difference]: Finished difference Result 2464 states and 3243 transitions. [2019-09-10 08:31:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:41,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:41,704 INFO L225 Difference]: With dead ends: 2464 [2019-09-10 08:31:41,705 INFO L226 Difference]: Without dead ends: 2464 [2019-09-10 08:31:41,705 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 08:31:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-09-10 08:31:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1411. [2019-09-10 08:31:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1812 transitions. [2019-09-10 08:31:41,718 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1812 transitions. Word has length 123 [2019-09-10 08:31:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:41,719 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1812 transitions. [2019-09-10 08:31:41,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1812 transitions. [2019-09-10 08:31:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:41,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:41,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:41,720 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash -630607940, now seen corresponding path program 1 times [2019-09-10 08:31:41,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:41,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:41,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:41,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:41,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:42,043 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 08:31:42,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:42,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:42,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:42,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:42,044 INFO L87 Difference]: Start difference. First operand 1411 states and 1812 transitions. Second operand 9 states. [2019-09-10 08:31:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:44,569 INFO L93 Difference]: Finished difference Result 2392 states and 3116 transitions. [2019-09-10 08:31:44,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:44,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:44,572 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:44,572 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:44,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1810 transitions. [2019-09-10 08:31:44,584 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1810 transitions. Word has length 123 [2019-09-10 08:31:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:44,585 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1810 transitions. [2019-09-10 08:31:44,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1810 transitions. [2019-09-10 08:31:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:44,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:44,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:44,586 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:44,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1237976956, now seen corresponding path program 1 times [2019-09-10 08:31:44,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:44,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:44,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:44,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:44,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:31:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:44,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:44,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:44,816 INFO L87 Difference]: Start difference. First operand 1411 states and 1810 transitions. Second operand 9 states. [2019-09-10 08:31:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:47,299 INFO L93 Difference]: Finished difference Result 2392 states and 3112 transitions. [2019-09-10 08:31:47,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:47,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-10 08:31:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:47,303 INFO L225 Difference]: With dead ends: 2392 [2019-09-10 08:31:47,303 INFO L226 Difference]: Without dead ends: 2392 [2019-09-10 08:31:47,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:31:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-09-10 08:31:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1411. [2019-09-10 08:31:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-09-10 08:31:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1808 transitions. [2019-09-10 08:31:47,315 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1808 transitions. Word has length 123 [2019-09-10 08:31:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:47,315 INFO L475 AbstractCegarLoop]: Abstraction has 1411 states and 1808 transitions. [2019-09-10 08:31:47,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1808 transitions. [2019-09-10 08:31:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:31:47,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:47,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:47,317 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 106319961, now seen corresponding path program 1 times [2019-09-10 08:31:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:47,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:47,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:47,944 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 08:31:47,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:47,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:31:47,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:47,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:31:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:31:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:31:47,945 INFO L87 Difference]: Start difference. First operand 1411 states and 1808 transitions. Second operand 13 states. [2019-09-10 08:31:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:49,545 INFO L93 Difference]: Finished difference Result 1942 states and 2553 transitions. [2019-09-10 08:31:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:49,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2019-09-10 08:31:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:49,548 INFO L225 Difference]: With dead ends: 1942 [2019-09-10 08:31:49,548 INFO L226 Difference]: Without dead ends: 1942 [2019-09-10 08:31:49,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:31:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-09-10 08:31:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1212. [2019-09-10 08:31:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:31:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1549 transitions. [2019-09-10 08:31:49,559 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1549 transitions. Word has length 123 [2019-09-10 08:31:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:49,559 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1549 transitions. [2019-09-10 08:31:49,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:31:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1549 transitions. [2019-09-10 08:31:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:31:49,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:49,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:49,560 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1902905422, now seen corresponding path program 1 times [2019-09-10 08:31:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:49,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:49,841 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 08:31:49,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:49,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:49,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:49,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:49,842 INFO L87 Difference]: Start difference. First operand 1212 states and 1549 transitions. Second operand 9 states. [2019-09-10 08:31:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:52,527 INFO L93 Difference]: Finished difference Result 2127 states and 2772 transitions. [2019-09-10 08:31:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:52,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:31:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:52,530 INFO L225 Difference]: With dead ends: 2127 [2019-09-10 08:31:52,530 INFO L226 Difference]: Without dead ends: 2127 [2019-09-10 08:31:52,531 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 08:31:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-10 08:31:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-10 08:31:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:31:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1548 transitions. [2019-09-10 08:31:52,541 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1548 transitions. Word has length 124 [2019-09-10 08:31:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:52,542 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1548 transitions. [2019-09-10 08:31:52,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1548 transitions. [2019-09-10 08:31:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:31:52,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:52,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:52,543 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1770593266, now seen corresponding path program 1 times [2019-09-10 08:31:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:52,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:52,860 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 08:31:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:52,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:52,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:52,862 INFO L87 Difference]: Start difference. First operand 1212 states and 1548 transitions. Second operand 9 states. [2019-09-10 08:31:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:55,774 INFO L93 Difference]: Finished difference Result 2183 states and 2869 transitions. [2019-09-10 08:31:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:55,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:31:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:55,777 INFO L225 Difference]: With dead ends: 2183 [2019-09-10 08:31:55,777 INFO L226 Difference]: Without dead ends: 2183 [2019-09-10 08:31:55,778 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 08:31:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-09-10 08:31:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1212. [2019-09-10 08:31:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:31:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1547 transitions. [2019-09-10 08:31:55,788 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1547 transitions. Word has length 124 [2019-09-10 08:31:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:55,789 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1547 transitions. [2019-09-10 08:31:55,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1547 transitions. [2019-09-10 08:31:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:31:55,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:55,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:55,790 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 232203662, now seen corresponding path program 1 times [2019-09-10 08:31:55,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:55,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:56,067 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 08:31:56,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:56,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:56,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:56,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:56,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:56,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:56,068 INFO L87 Difference]: Start difference. First operand 1212 states and 1547 transitions. Second operand 9 states. [2019-09-10 08:31:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:58,774 INFO L93 Difference]: Finished difference Result 2183 states and 2867 transitions. [2019-09-10 08:31:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:31:58,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:31:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:58,778 INFO L225 Difference]: With dead ends: 2183 [2019-09-10 08:31:58,778 INFO L226 Difference]: Without dead ends: 2183 [2019-09-10 08:31:58,778 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 08:31:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2019-09-10 08:31:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1212. [2019-09-10 08:31:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:31:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1546 transitions. [2019-09-10 08:31:58,791 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1546 transitions. Word has length 124 [2019-09-10 08:31:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:31:58,791 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1546 transitions. [2019-09-10 08:31:58,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:31:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1546 transitions. [2019-09-10 08:31:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:31:58,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:31:58,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:31:58,792 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:31:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:31:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1645493938, now seen corresponding path program 1 times [2019-09-10 08:31:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:31:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:31:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:31:58,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:31:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:31:59,040 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 08:31:59,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:31:59,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:31:59,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:31:59,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:31:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:31:59,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:31:59,042 INFO L87 Difference]: Start difference. First operand 1212 states and 1546 transitions. Second operand 9 states. [2019-09-10 08:32:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:01,602 INFO L93 Difference]: Finished difference Result 2127 states and 2769 transitions. [2019-09-10 08:32:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:01,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:01,606 INFO L225 Difference]: With dead ends: 2127 [2019-09-10 08:32:01,606 INFO L226 Difference]: Without dead ends: 2127 [2019-09-10 08:32:01,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-10 08:32:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-10 08:32:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:32:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1545 transitions. [2019-09-10 08:32:01,617 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1545 transitions. Word has length 124 [2019-09-10 08:32:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:01,617 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1545 transitions. [2019-09-10 08:32:01,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1545 transitions. [2019-09-10 08:32:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:01,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:01,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:01,619 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1545649006, now seen corresponding path program 1 times [2019-09-10 08:32:01,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:01,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:01,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:01,847 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 08:32:01,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:01,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:01,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:01,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:01,848 INFO L87 Difference]: Start difference. First operand 1212 states and 1545 transitions. Second operand 9 states. [2019-09-10 08:32:04,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:04,622 INFO L93 Difference]: Finished difference Result 2127 states and 2767 transitions. [2019-09-10 08:32:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:04,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:04,625 INFO L225 Difference]: With dead ends: 2127 [2019-09-10 08:32:04,625 INFO L226 Difference]: Without dead ends: 2127 [2019-09-10 08:32:04,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-10 08:32:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-10 08:32:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:32:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1544 transitions. [2019-09-10 08:32:04,637 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1544 transitions. Word has length 124 [2019-09-10 08:32:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:04,637 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1544 transitions. [2019-09-10 08:32:04,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1544 transitions. [2019-09-10 08:32:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:04,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:04,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:04,640 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:04,640 INFO L82 PathProgramCache]: Analyzing trace with hash 822278960, now seen corresponding path program 1 times [2019-09-10 08:32:04,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:04,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:04,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:04,874 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 08:32:04,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:04,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:04,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:04,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:04,875 INFO L87 Difference]: Start difference. First operand 1212 states and 1544 transitions. Second operand 9 states. [2019-09-10 08:32:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:07,518 INFO L93 Difference]: Finished difference Result 2127 states and 2766 transitions. [2019-09-10 08:32:07,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:07,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:07,522 INFO L225 Difference]: With dead ends: 2127 [2019-09-10 08:32:07,522 INFO L226 Difference]: Without dead ends: 2127 [2019-09-10 08:32:07,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-09-10 08:32:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1212. [2019-09-10 08:32:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2019-09-10 08:32:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1543 transitions. [2019-09-10 08:32:07,534 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1543 transitions. Word has length 124 [2019-09-10 08:32:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:07,534 INFO L475 AbstractCegarLoop]: Abstraction has 1212 states and 1543 transitions. [2019-09-10 08:32:07,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1543 transitions. [2019-09-10 08:32:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:07,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:07,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:07,535 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash 739015698, now seen corresponding path program 1 times [2019-09-10 08:32:07,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:07,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:07,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:08,320 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 08:32:08,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:08,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:32:08,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:08,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:32:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:32:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:32:08,321 INFO L87 Difference]: Start difference. First operand 1212 states and 1543 transitions. Second operand 15 states. [2019-09-10 08:32:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:10,862 INFO L93 Difference]: Finished difference Result 1739 states and 2286 transitions. [2019-09-10 08:32:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:32:10,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 124 [2019-09-10 08:32:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:10,865 INFO L225 Difference]: With dead ends: 1739 [2019-09-10 08:32:10,865 INFO L226 Difference]: Without dead ends: 1739 [2019-09-10 08:32:10,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:32:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2019-09-10 08:32:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 965. [2019-09-10 08:32:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1239 transitions. [2019-09-10 08:32:10,875 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1239 transitions. Word has length 124 [2019-09-10 08:32:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:10,876 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1239 transitions. [2019-09-10 08:32:10,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:32:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1239 transitions. [2019-09-10 08:32:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:10,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:10,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:10,877 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash -965884732, now seen corresponding path program 1 times [2019-09-10 08:32:10,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:10,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:11,221 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 08:32:11,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:11,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:11,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:11,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:11,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:11,222 INFO L87 Difference]: Start difference. First operand 965 states and 1239 transitions. Second operand 9 states. [2019-09-10 08:32:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:13,167 INFO L93 Difference]: Finished difference Result 1813 states and 2413 transitions. [2019-09-10 08:32:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:13,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:13,170 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:32:13,170 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:32:13,171 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 08:32:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:32:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-10 08:32:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1237 transitions. [2019-09-10 08:32:13,180 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1237 transitions. Word has length 124 [2019-09-10 08:32:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:13,181 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1237 transitions. [2019-09-10 08:32:13,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1237 transitions. [2019-09-10 08:32:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:13,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:13,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:13,182 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:13,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -819468636, now seen corresponding path program 1 times [2019-09-10 08:32:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:13,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:13,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:13,474 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 08:32:13,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:13,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:13,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:13,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:13,475 INFO L87 Difference]: Start difference. First operand 965 states and 1237 transitions. Second operand 9 states. [2019-09-10 08:32:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:15,457 INFO L93 Difference]: Finished difference Result 1773 states and 2339 transitions. [2019-09-10 08:32:15,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:15,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:15,460 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:32:15,460 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:32:15,460 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 08:32:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:32:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-10 08:32:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1235 transitions. [2019-09-10 08:32:15,471 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1235 transitions. Word has length 124 [2019-09-10 08:32:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:15,471 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1235 transitions. [2019-09-10 08:32:15,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1235 transitions. [2019-09-10 08:32:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:15,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:15,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:15,472 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -382534300, now seen corresponding path program 1 times [2019-09-10 08:32:15,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:15,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:15,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:15,700 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 08:32:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:15,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:15,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:15,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:15,701 INFO L87 Difference]: Start difference. First operand 965 states and 1235 transitions. Second operand 9 states. [2019-09-10 08:32:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:17,877 INFO L93 Difference]: Finished difference Result 1833 states and 2435 transitions. [2019-09-10 08:32:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:17,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:17,879 INFO L225 Difference]: With dead ends: 1833 [2019-09-10 08:32:17,879 INFO L226 Difference]: Without dead ends: 1833 [2019-09-10 08:32:17,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2019-09-10 08:32:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 965. [2019-09-10 08:32:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1233 transitions. [2019-09-10 08:32:17,890 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1233 transitions. Word has length 124 [2019-09-10 08:32:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:17,890 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1233 transitions. [2019-09-10 08:32:17,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1233 transitions. [2019-09-10 08:32:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:17,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:17,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:17,891 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash -446756188, now seen corresponding path program 1 times [2019-09-10 08:32:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:17,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:18,135 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 08:32:18,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:18,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:18,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:18,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:18,137 INFO L87 Difference]: Start difference. First operand 965 states and 1233 transitions. Second operand 9 states. [2019-09-10 08:32:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:20,267 INFO L93 Difference]: Finished difference Result 1813 states and 2405 transitions. [2019-09-10 08:32:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:20,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:20,270 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:32:20,270 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:32:20,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:32:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-10 08:32:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1231 transitions. [2019-09-10 08:32:20,280 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1231 transitions. Word has length 124 [2019-09-10 08:32:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:20,280 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1231 transitions. [2019-09-10 08:32:20,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1231 transitions. [2019-09-10 08:32:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:20,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:20,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:20,281 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash -300340092, now seen corresponding path program 1 times [2019-09-10 08:32:20,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:20,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:20,503 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 08:32:20,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:20,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:20,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:20,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:20,504 INFO L87 Difference]: Start difference. First operand 965 states and 1231 transitions. Second operand 9 states. [2019-09-10 08:32:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:22,471 INFO L93 Difference]: Finished difference Result 1773 states and 2333 transitions. [2019-09-10 08:32:22,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:22,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:22,474 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:32:22,474 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:32:22,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:32:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-10 08:32:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1229 transitions. [2019-09-10 08:32:22,485 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1229 transitions. Word has length 124 [2019-09-10 08:32:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:22,485 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1229 transitions. [2019-09-10 08:32:22,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1229 transitions. [2019-09-10 08:32:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:22,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:22,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:22,486 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:22,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash 117914884, now seen corresponding path program 1 times [2019-09-10 08:32:22,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:22,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:22,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:22,713 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 08:32:22,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:22,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:22,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:22,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:22,714 INFO L87 Difference]: Start difference. First operand 965 states and 1229 transitions. Second operand 9 states. [2019-09-10 08:32:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:24,684 INFO L93 Difference]: Finished difference Result 1773 states and 2331 transitions. [2019-09-10 08:32:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:24,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:24,687 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:32:24,687 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:32:24,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:32:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-10 08:32:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1227 transitions. [2019-09-10 08:32:24,697 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1227 transitions. Word has length 124 [2019-09-10 08:32:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:24,697 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1227 transitions. [2019-09-10 08:32:24,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1227 transitions. [2019-09-10 08:32:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:32:24,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:32:24,698 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -28501212, now seen corresponding path program 1 times [2019-09-10 08:32:24,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:24,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:24,922 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 08:32:24,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:24,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:24,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:24,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:24,923 INFO L87 Difference]: Start difference. First operand 965 states and 1227 transitions. Second operand 9 states. [2019-09-10 08:32:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:27,216 INFO L93 Difference]: Finished difference Result 1813 states and 2393 transitions. [2019-09-10 08:32:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:27,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-10 08:32:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:27,219 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:32:27,219 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:32:27,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:32:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-10 08:32:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1225 transitions. [2019-09-10 08:32:27,228 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1225 transitions. Word has length 124 [2019-09-10 08:32:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:27,228 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1225 transitions. [2019-09-10 08:32:27,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1225 transitions. [2019-09-10 08:32:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:27,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:27,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:27,230 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash 315424146, now seen corresponding path program 1 times [2019-09-10 08:32:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:27,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:27,462 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 08:32:27,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:27,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:27,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:27,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:27,463 INFO L87 Difference]: Start difference. First operand 965 states and 1225 transitions. Second operand 9 states. [2019-09-10 08:32:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:29,282 INFO L93 Difference]: Finished difference Result 1773 states and 2328 transitions. [2019-09-10 08:32:29,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:29,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-10 08:32:29,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:29,285 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:32:29,285 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:32:29,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:32:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 965. [2019-09-10 08:32:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1224 transitions. [2019-09-10 08:32:29,295 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1224 transitions. Word has length 125 [2019-09-10 08:32:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:29,295 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1224 transitions. [2019-09-10 08:32:29,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1224 transitions. [2019-09-10 08:32:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:29,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:29,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:29,296 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -773317262, now seen corresponding path program 1 times [2019-09-10 08:32:29,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:29,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:29,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:29,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:29,515 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 08:32:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:32:29,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:29,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:32:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:32:29,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:32:29,516 INFO L87 Difference]: Start difference. First operand 965 states and 1224 transitions. Second operand 9 states. [2019-09-10 08:32:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:31,641 INFO L93 Difference]: Finished difference Result 1813 states and 2389 transitions. [2019-09-10 08:32:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:31,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-10 08:32:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:31,644 INFO L225 Difference]: With dead ends: 1813 [2019-09-10 08:32:31,644 INFO L226 Difference]: Without dead ends: 1813 [2019-09-10 08:32:31,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-10 08:32:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 965. [2019-09-10 08:32:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-10 08:32:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1223 transitions. [2019-09-10 08:32:31,654 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1223 transitions. Word has length 125 [2019-09-10 08:32:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:31,654 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1223 transitions. [2019-09-10 08:32:31,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:32:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1223 transitions. [2019-09-10 08:32:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:31,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:31,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:31,656 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash 870691223, now seen corresponding path program 1 times [2019-09-10 08:32:31,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:31,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:32,820 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:32:32,965 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-10 08:32:34,425 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 08:32:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:32:34,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:34,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:32:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:32:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:32:34,426 INFO L87 Difference]: Start difference. First operand 965 states and 1223 transitions. Second operand 31 states. [2019-09-10 08:32:34,658 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-10 08:32:35,732 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-09-10 08:32:35,913 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 08:32:36,556 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-10 08:32:36,875 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-10 08:32:37,292 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-09-10 08:32:37,734 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-09-10 08:32:38,308 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-09-10 08:32:38,613 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 08:32:38,896 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-10 08:32:39,226 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-10 08:32:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:50,342 INFO L93 Difference]: Finished difference Result 1783 states and 2348 transitions. [2019-09-10 08:32:50,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:32:50,343 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 125 [2019-09-10 08:32:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:50,345 INFO L225 Difference]: With dead ends: 1783 [2019-09-10 08:32:50,345 INFO L226 Difference]: Without dead ends: 1783 [2019-09-10 08:32:50,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=454, Invalid=1898, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:32:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2019-09-10 08:32:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 992. [2019-09-10 08:32:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-09-10 08:32:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1257 transitions. [2019-09-10 08:32:50,355 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1257 transitions. Word has length 125 [2019-09-10 08:32:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:50,356 INFO L475 AbstractCegarLoop]: Abstraction has 992 states and 1257 transitions. [2019-09-10 08:32:50,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:32:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1257 transitions. [2019-09-10 08:32:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:50,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:50,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:50,357 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash -214993769, now seen corresponding path program 1 times [2019-09-10 08:32:50,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:50,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:50,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,243 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 08:32:51,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:32:51,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:32:51,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:32:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:32:51,245 INFO L87 Difference]: Start difference. First operand 992 states and 1257 transitions. Second operand 17 states. [2019-09-10 08:32:51,880 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:32:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:53,923 INFO L93 Difference]: Finished difference Result 1957 states and 2568 transitions. [2019-09-10 08:32:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:32:53,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2019-09-10 08:32:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:53,926 INFO L225 Difference]: With dead ends: 1957 [2019-09-10 08:32:53,926 INFO L226 Difference]: Without dead ends: 1957 [2019-09-10 08:32:53,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:32:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2019-09-10 08:32:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 940. [2019-09-10 08:32:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-10 08:32:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1188 transitions. [2019-09-10 08:32:53,936 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1188 transitions. Word has length 125 [2019-09-10 08:32:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:53,936 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1188 transitions. [2019-09-10 08:32:53,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:32:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1188 transitions. [2019-09-10 08:32:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:32:53,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:53,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:32:53,937 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -131595721, now seen corresponding path program 1 times [2019-09-10 08:32:53,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:53,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:53,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:55,240 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 08:32:55,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:55,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:32:55,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:55,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:32:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:32:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:32:55,241 INFO L87 Difference]: Start difference. First operand 940 states and 1188 transitions. Second operand 22 states. [2019-09-10 08:32:56,424 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:32:56,681 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-10 08:32:57,078 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-10 08:32:57,227 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:32:57,505 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:33:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:00,732 INFO L93 Difference]: Finished difference Result 1990 states and 2570 transitions. [2019-09-10 08:33:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:33:00,732 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-09-10 08:33:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:00,735 INFO L225 Difference]: With dead ends: 1990 [2019-09-10 08:33:00,735 INFO L226 Difference]: Without dead ends: 1990 [2019-09-10 08:33:00,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:33:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-09-10 08:33:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 954. [2019-09-10 08:33:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2019-09-10 08:33:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1202 transitions. [2019-09-10 08:33:00,744 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1202 transitions. Word has length 125 [2019-09-10 08:33:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:00,744 INFO L475 AbstractCegarLoop]: Abstraction has 954 states and 1202 transitions. [2019-09-10 08:33:00,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1202 transitions. [2019-09-10 08:33:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:33:00,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:00,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:00,745 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1811701961, now seen corresponding path program 1 times [2019-09-10 08:33:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:00,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:00,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:01,628 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 08:33:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:01,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:01,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:01,629 INFO L87 Difference]: Start difference. First operand 954 states and 1202 transitions. Second operand 17 states. [2019-09-10 08:33:02,340 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:33:02,496 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:33:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:04,483 INFO L93 Difference]: Finished difference Result 1855 states and 2433 transitions. [2019-09-10 08:33:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:33:04,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 125 [2019-09-10 08:33:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:04,486 INFO L225 Difference]: With dead ends: 1855 [2019-09-10 08:33:04,486 INFO L226 Difference]: Without dead ends: 1855 [2019-09-10 08:33:04,487 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 08:33:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-09-10 08:33:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 912. [2019-09-10 08:33:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 08:33:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1144 transitions. [2019-09-10 08:33:04,496 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1144 transitions. Word has length 125 [2019-09-10 08:33:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:04,496 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1144 transitions. [2019-09-10 08:33:04,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1144 transitions. [2019-09-10 08:33:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:04,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:04,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:04,497 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1343428439, now seen corresponding path program 1 times [2019-09-10 08:33:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:04,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:04,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:05,045 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 08:33:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:05,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:33:05,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:05,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:33:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:33:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:33:05,046 INFO L87 Difference]: Start difference. First operand 912 states and 1144 transitions. Second operand 12 states. [2019-09-10 08:33:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:07,279 INFO L93 Difference]: Finished difference Result 2008 states and 2690 transitions. [2019-09-10 08:33:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:33:07,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2019-09-10 08:33:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:07,282 INFO L225 Difference]: With dead ends: 2008 [2019-09-10 08:33:07,282 INFO L226 Difference]: Without dead ends: 2008 [2019-09-10 08:33:07,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:33:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-09-10 08:33:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 911. [2019-09-10 08:33:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2019-09-10 08:33:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1142 transitions. [2019-09-10 08:33:07,292 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1142 transitions. Word has length 126 [2019-09-10 08:33:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:07,292 INFO L475 AbstractCegarLoop]: Abstraction has 911 states and 1142 transitions. [2019-09-10 08:33:07,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:33:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1142 transitions. [2019-09-10 08:33:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:07,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:07,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:07,293 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -434459607, now seen corresponding path program 1 times [2019-09-10 08:33:07,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:07,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:08,192 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 08:33:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:08,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:08,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:08,193 INFO L87 Difference]: Start difference. First operand 911 states and 1142 transitions. Second operand 17 states. [2019-09-10 08:33:08,886 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:33:09,033 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-10 08:33:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:11,434 INFO L93 Difference]: Finished difference Result 1722 states and 2261 transitions. [2019-09-10 08:33:11,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:33:11,435 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 08:33:11,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:11,437 INFO L225 Difference]: With dead ends: 1722 [2019-09-10 08:33:11,437 INFO L226 Difference]: Without dead ends: 1722 [2019-09-10 08:33:11,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:33:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2019-09-10 08:33:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 903. [2019-09-10 08:33:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-10 08:33:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1130 transitions. [2019-09-10 08:33:11,447 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1130 transitions. Word has length 126 [2019-09-10 08:33:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:11,447 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1130 transitions. [2019-09-10 08:33:11,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1130 transitions. [2019-09-10 08:33:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:11,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:11,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:11,448 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1958530185, now seen corresponding path program 1 times [2019-09-10 08:33:11,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:11,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:12,848 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 08:33:12,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:12,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:33:12,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:12,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:33:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:33:12,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:12,849 INFO L87 Difference]: Start difference. First operand 903 states and 1130 transitions. Second operand 22 states. [2019-09-10 08:33:14,014 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 74 [2019-09-10 08:33:14,289 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-10 08:33:14,621 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-09-10 08:33:14,822 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-10 08:33:15,164 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:33:15,494 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:33:15,680 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 08:33:15,909 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-09-10 08:33:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:19,118 INFO L93 Difference]: Finished difference Result 1693 states and 2181 transitions. [2019-09-10 08:33:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:33:19,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-09-10 08:33:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:19,121 INFO L225 Difference]: With dead ends: 1693 [2019-09-10 08:33:19,121 INFO L226 Difference]: Without dead ends: 1693 [2019-09-10 08:33:19,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:33:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-09-10 08:33:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 910. [2019-09-10 08:33:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-09-10 08:33:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1137 transitions. [2019-09-10 08:33:19,130 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1137 transitions. Word has length 126 [2019-09-10 08:33:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:19,131 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1137 transitions. [2019-09-10 08:33:19,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1137 transitions. [2019-09-10 08:33:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:19,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:19,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:19,132 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:19,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash 10193769, now seen corresponding path program 1 times [2019-09-10 08:33:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:19,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:19,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:20,396 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 08:33:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:20,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:33:20,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:20,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:33:20,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:33:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:33:20,397 INFO L87 Difference]: Start difference. First operand 910 states and 1137 transitions. Second operand 22 states. [2019-09-10 08:33:21,562 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-09-10 08:33:21,840 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-10 08:33:22,158 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-09-10 08:33:22,342 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:33:22,619 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:33:22,857 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:33:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:27,706 INFO L93 Difference]: Finished difference Result 2105 states and 2759 transitions. [2019-09-10 08:33:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:33:27,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 126 [2019-09-10 08:33:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:27,709 INFO L225 Difference]: With dead ends: 2105 [2019-09-10 08:33:27,709 INFO L226 Difference]: Without dead ends: 2105 [2019-09-10 08:33:27,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 08:33:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2019-09-10 08:33:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 917. [2019-09-10 08:33:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-10 08:33:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1144 transitions. [2019-09-10 08:33:27,719 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1144 transitions. Word has length 126 [2019-09-10 08:33:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:27,719 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1144 transitions. [2019-09-10 08:33:27,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:33:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1144 transitions. [2019-09-10 08:33:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:27,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:27,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:27,720 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1360330293, now seen corresponding path program 1 times [2019-09-10 08:33:27,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:28,532 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 08:33:28,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:28,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:33:28,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:28,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:33:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:33:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:33:28,533 INFO L87 Difference]: Start difference. First operand 917 states and 1144 transitions. Second operand 17 states. [2019-09-10 08:33:29,292 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:33:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:31,995 INFO L93 Difference]: Finished difference Result 1736 states and 2268 transitions. [2019-09-10 08:33:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:33:31,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 08:33:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:31,998 INFO L225 Difference]: With dead ends: 1736 [2019-09-10 08:33:31,998 INFO L226 Difference]: Without dead ends: 1736 [2019-09-10 08:33:31,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:33:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2019-09-10 08:33:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 917. [2019-09-10 08:33:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-10 08:33:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1142 transitions. [2019-09-10 08:33:32,007 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1142 transitions. Word has length 126 [2019-09-10 08:33:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:32,007 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1142 transitions. [2019-09-10 08:33:32,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:33:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1142 transitions. [2019-09-10 08:33:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:32,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:32,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:32,008 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -994061552, now seen corresponding path program 1 times [2019-09-10 08:33:32,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:32,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:32,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:33,044 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 08:33:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:33,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:33:33,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:33,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:33:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:33:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:33:33,045 INFO L87 Difference]: Start difference. First operand 917 states and 1142 transitions. Second operand 15 states. [2019-09-10 08:33:33,197 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-10 08:33:33,448 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:33:33,710 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:33:33,881 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-10 08:33:34,083 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-09-10 08:33:34,312 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:33:34,530 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-09-10 08:33:35,092 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 08:33:35,516 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-09-10 08:33:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:37,292 INFO L93 Difference]: Finished difference Result 2951 states and 3996 transitions. [2019-09-10 08:33:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:33:37,292 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 126 [2019-09-10 08:33:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:37,296 INFO L225 Difference]: With dead ends: 2951 [2019-09-10 08:33:37,296 INFO L226 Difference]: Without dead ends: 2951 [2019-09-10 08:33:37,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:33:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-09-10 08:33:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 831. [2019-09-10 08:33:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-10 08:33:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1032 transitions. [2019-09-10 08:33:37,308 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1032 transitions. Word has length 126 [2019-09-10 08:33:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:37,309 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1032 transitions. [2019-09-10 08:33:37,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:33:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1032 transitions. [2019-09-10 08:33:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:33:37,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:37,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:37,310 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1306627305, now seen corresponding path program 1 times [2019-09-10 08:33:37,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:37,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:37,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:37,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:38,308 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 08:33:38,454 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:33:38,639 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-10 08:33:38,803 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 08:33:39,004 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-09-10 08:33:39,200 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-10 08:33:39,387 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-10 08:33:39,577 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 08:33:39,759 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-10 08:33:41,623 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 08:33:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:33:41,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:41,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:33:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:33:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1186, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:33:41,625 INFO L87 Difference]: Start difference. First operand 831 states and 1032 transitions. Second operand 36 states. [2019-09-10 08:33:41,948 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-09-10 08:33:43,262 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2019-09-10 08:33:43,484 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-09-10 08:33:43,731 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-10 08:33:43,976 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-09-10 08:33:44,829 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-09-10 08:33:45,293 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 84 [2019-09-10 08:33:45,817 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 98 [2019-09-10 08:33:46,442 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 113 [2019-09-10 08:33:47,232 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 127 [2019-09-10 08:33:48,147 WARN L188 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 146 [2019-09-10 08:33:48,592 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-09-10 08:33:49,003 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-09-10 08:33:49,262 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 08:34:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:00,231 INFO L93 Difference]: Finished difference Result 1257 states and 1576 transitions. [2019-09-10 08:34:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 08:34:00,232 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 126 [2019-09-10 08:34:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:00,233 INFO L225 Difference]: With dead ends: 1257 [2019-09-10 08:34:00,233 INFO L226 Difference]: Without dead ends: 1257 [2019-09-10 08:34:00,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:34:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-10 08:34:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 860. [2019-09-10 08:34:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-09-10 08:34:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1069 transitions. [2019-09-10 08:34:00,244 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1069 transitions. Word has length 126 [2019-09-10 08:34:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:00,245 INFO L475 AbstractCegarLoop]: Abstraction has 860 states and 1069 transitions. [2019-09-10 08:34:00,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:34:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1069 transitions. [2019-09-10 08:34:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:00,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:00,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:00,246 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1978228488, now seen corresponding path program 1 times [2019-09-10 08:34:00,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:00,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:00,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:00,761 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 08:34:00,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:34:00,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:00,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:34:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:34:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:34:00,763 INFO L87 Difference]: Start difference. First operand 860 states and 1069 transitions. Second operand 11 states. [2019-09-10 08:34:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:01,832 INFO L93 Difference]: Finished difference Result 2418 states and 3321 transitions. [2019-09-10 08:34:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:01,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2019-09-10 08:34:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:01,835 INFO L225 Difference]: With dead ends: 2418 [2019-09-10 08:34:01,836 INFO L226 Difference]: Without dead ends: 2418 [2019-09-10 08:34:01,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2019-09-10 08:34:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 838. [2019-09-10 08:34:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-10 08:34:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1040 transitions. [2019-09-10 08:34:01,846 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1040 transitions. Word has length 126 [2019-09-10 08:34:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:01,846 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1040 transitions. [2019-09-10 08:34:01,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:34:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1040 transitions. [2019-09-10 08:34:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:01,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:01,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:01,847 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:01,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:01,848 INFO L82 PathProgramCache]: Analyzing trace with hash 535165735, now seen corresponding path program 1 times [2019-09-10 08:34:01,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:01,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:01,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:01,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:02,568 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 08:34:02,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:02,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:34:02,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:02,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:34:02,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:34:02,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:34:02,569 INFO L87 Difference]: Start difference. First operand 838 states and 1040 transitions. Second operand 13 states. [2019-09-10 08:34:03,134 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:34:03,271 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-10 08:34:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:04,677 INFO L93 Difference]: Finished difference Result 2789 states and 3798 transitions. [2019-09-10 08:34:04,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:34:04,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 126 [2019-09-10 08:34:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:04,681 INFO L225 Difference]: With dead ends: 2789 [2019-09-10 08:34:04,681 INFO L226 Difference]: Without dead ends: 2789 [2019-09-10 08:34:04,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2019-09-10 08:34:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 816. [2019-09-10 08:34:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-10 08:34:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1011 transitions. [2019-09-10 08:34:04,692 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1011 transitions. Word has length 126 [2019-09-10 08:34:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:04,692 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1011 transitions. [2019-09-10 08:34:04,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:34:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1011 transitions. [2019-09-10 08:34:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:04,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:04,694 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -899678243, now seen corresponding path program 1 times [2019-09-10 08:34:04,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:04,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:06,004 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 08:34:06,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:34:06,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:06,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:34:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:34:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:06,005 INFO L87 Difference]: Start difference. First operand 816 states and 1011 transitions. Second operand 21 states. [2019-09-10 08:34:07,069 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 08:34:07,313 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 08:34:07,487 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:34:07,688 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:34:07,873 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:34:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:10,756 INFO L93 Difference]: Finished difference Result 1511 states and 1971 transitions. [2019-09-10 08:34:10,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:34:10,756 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-10 08:34:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:10,758 INFO L225 Difference]: With dead ends: 1511 [2019-09-10 08:34:10,758 INFO L226 Difference]: Without dead ends: 1511 [2019-09-10 08:34:10,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:34:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-09-10 08:34:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 839. [2019-09-10 08:34:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-10 08:34:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1042 transitions. [2019-09-10 08:34:10,767 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1042 transitions. Word has length 126 [2019-09-10 08:34:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:10,768 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1042 transitions. [2019-09-10 08:34:10,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:34:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1042 transitions. [2019-09-10 08:34:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:10,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:10,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:10,769 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -480497379, now seen corresponding path program 1 times [2019-09-10 08:34:10,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:10,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:12,324 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 08:34:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:34:12,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:12,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:34:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:34:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:12,325 INFO L87 Difference]: Start difference. First operand 839 states and 1042 transitions. Second operand 21 states. [2019-09-10 08:34:12,566 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-10 08:34:13,050 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2019-09-10 08:34:13,214 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-09-10 08:34:13,432 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:34:13,824 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-10 08:34:14,111 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-09-10 08:34:14,423 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-09-10 08:34:14,833 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-09-10 08:34:15,116 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 08:34:15,487 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-10 08:34:15,909 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-09-10 08:34:16,520 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-10 08:34:16,974 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 08:34:17,241 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-10 08:34:17,752 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-10 08:34:18,085 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-09-10 08:34:18,549 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 08:34:20,878 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-09-10 08:34:21,187 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-09-10 08:34:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:21,787 INFO L93 Difference]: Finished difference Result 2722 states and 3674 transitions. [2019-09-10 08:34:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 08:34:21,788 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-10 08:34:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:21,791 INFO L225 Difference]: With dead ends: 2722 [2019-09-10 08:34:21,791 INFO L226 Difference]: Without dead ends: 2722 [2019-09-10 08:34:21,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:34:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2019-09-10 08:34:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 823. [2019-09-10 08:34:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-10 08:34:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1019 transitions. [2019-09-10 08:34:21,801 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1019 transitions. Word has length 126 [2019-09-10 08:34:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:21,801 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1019 transitions. [2019-09-10 08:34:21,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:34:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1019 transitions. [2019-09-10 08:34:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:21,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:21,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:34:21,803 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1729624950, now seen corresponding path program 1 times [2019-09-10 08:34:21,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:21,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:21,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:21,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:22,628 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 08:34:22,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:22,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:34:22,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:22,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:34:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:34:22,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:34:22,630 INFO L87 Difference]: Start difference. First operand 823 states and 1019 transitions. Second operand 16 states. [2019-09-10 08:34:23,856 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:34:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:25,351 INFO L93 Difference]: Finished difference Result 1894 states and 2537 transitions. [2019-09-10 08:34:25,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:34:25,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 126 [2019-09-10 08:34:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:25,354 INFO L225 Difference]: With dead ends: 1894 [2019-09-10 08:34:25,355 INFO L226 Difference]: Without dead ends: 1894 [2019-09-10 08:34:25,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:34:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-09-10 08:34:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 807. [2019-09-10 08:34:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-10 08:34:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 997 transitions. [2019-09-10 08:34:25,366 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 997 transitions. Word has length 126 [2019-09-10 08:34:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:25,367 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 997 transitions. [2019-09-10 08:34:25,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:34:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 997 transitions. [2019-09-10 08:34:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:34:25,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:25,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:25,368 INFO L418 AbstractCegarLoop]: === Iteration 129 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1310444086, now seen corresponding path program 1 times [2019-09-10 08:34:25,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:25,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:25,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:26,672 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 08:34:26,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:26,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:34:26,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:26,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:34:26,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:34:26,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:34:26,673 INFO L87 Difference]: Start difference. First operand 807 states and 997 transitions. Second operand 21 states. [2019-09-10 08:34:27,744 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-10 08:34:27,993 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 08:34:28,169 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:34:28,336 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:34:28,552 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:34:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:31,158 INFO L93 Difference]: Finished difference Result 1480 states and 1927 transitions. [2019-09-10 08:34:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:34:31,158 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2019-09-10 08:34:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:31,160 INFO L225 Difference]: With dead ends: 1480 [2019-09-10 08:34:31,161 INFO L226 Difference]: Without dead ends: 1480 [2019-09-10 08:34:31,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:34:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-10 08:34:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 825. [2019-09-10 08:34:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-10 08:34:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1017 transitions. [2019-09-10 08:34:31,169 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1017 transitions. Word has length 126 [2019-09-10 08:34:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:31,170 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1017 transitions. [2019-09-10 08:34:31,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:34:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1017 transitions. [2019-09-10 08:34:31,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:31,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:31,170 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, 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 08:34:31,171 INFO L418 AbstractCegarLoop]: === Iteration 130 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:31,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:31,171 INFO L82 PathProgramCache]: Analyzing trace with hash -399736137, now seen corresponding path program 1 times [2019-09-10 08:34:31,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:31,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:31,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:31,730 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 08:34:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:34:31,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:31,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:34:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:34:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:34:31,731 INFO L87 Difference]: Start difference. First operand 825 states and 1017 transitions. Second operand 13 states. [2019-09-10 08:34:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:33,580 INFO L93 Difference]: Finished difference Result 1482 states and 1865 transitions. [2019-09-10 08:34:33,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:34:33,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 08:34:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:33,582 INFO L225 Difference]: With dead ends: 1482 [2019-09-10 08:34:33,582 INFO L226 Difference]: Without dead ends: 1482 [2019-09-10 08:34:33,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:34:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2019-09-10 08:34:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 821. [2019-09-10 08:34:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-10 08:34:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1012 transitions. [2019-09-10 08:34:33,591 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1012 transitions. Word has length 127 [2019-09-10 08:34:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:33,591 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1012 transitions. [2019-09-10 08:34:33,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:34:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1012 transitions. [2019-09-10 08:34:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:33,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:33,592 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, 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 08:34:33,592 INFO L418 AbstractCegarLoop]: === Iteration 131 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash 9866519, now seen corresponding path program 1 times [2019-09-10 08:34:33,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:33,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:33,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:33,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:33,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:34,451 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 08:34:34,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:34,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:34,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:34,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:34,452 INFO L87 Difference]: Start difference. First operand 821 states and 1012 transitions. Second operand 17 states. [2019-09-10 08:34:35,197 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:34:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:37,456 INFO L93 Difference]: Finished difference Result 1603 states and 2087 transitions. [2019-09-10 08:34:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:34:37,456 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-10 08:34:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:37,458 INFO L225 Difference]: With dead ends: 1603 [2019-09-10 08:34:37,458 INFO L226 Difference]: Without dead ends: 1603 [2019-09-10 08:34:37,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:34:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-09-10 08:34:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 821. [2019-09-10 08:34:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-09-10 08:34:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1011 transitions. [2019-09-10 08:34:37,467 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1011 transitions. Word has length 127 [2019-09-10 08:34:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:37,467 INFO L475 AbstractCegarLoop]: Abstraction has 821 states and 1011 transitions. [2019-09-10 08:34:37,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:34:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1011 transitions. [2019-09-10 08:34:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:37,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:37,469 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, 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 08:34:37,469 INFO L418 AbstractCegarLoop]: === Iteration 132 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash -998433958, now seen corresponding path program 1 times [2019-09-10 08:34:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:37,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:37,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:37,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:38,734 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 08:34:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:38,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:34:38,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:38,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:34:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:34:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:34:38,735 INFO L87 Difference]: Start difference. First operand 821 states and 1011 transitions. Second operand 20 states. [2019-09-10 08:34:38,983 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-10 08:34:39,400 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2019-09-10 08:34:39,568 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-10 08:34:39,732 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-09-10 08:34:40,008 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:34:40,400 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:34:40,735 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-10 08:34:41,039 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:34:41,340 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:34:41,628 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2019-09-10 08:34:41,937 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:34:42,515 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 08:34:42,980 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-10 08:34:43,802 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-09-10 08:34:44,279 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 08:34:44,503 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-10 08:34:46,953 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-10 08:34:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:47,213 INFO L93 Difference]: Finished difference Result 2376 states and 3185 transitions. [2019-09-10 08:34:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:34:47,213 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 127 [2019-09-10 08:34:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:47,216 INFO L225 Difference]: With dead ends: 2376 [2019-09-10 08:34:47,216 INFO L226 Difference]: Without dead ends: 2376 [2019-09-10 08:34:47,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=345, Invalid=1215, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 08:34:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-09-10 08:34:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 820. [2019-09-10 08:34:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-10 08:34:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1009 transitions. [2019-09-10 08:34:47,226 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1009 transitions. Word has length 127 [2019-09-10 08:34:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:47,226 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1009 transitions. [2019-09-10 08:34:47,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:34:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1009 transitions. [2019-09-10 08:34:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:47,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:47,227 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, 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 08:34:47,228 INFO L418 AbstractCegarLoop]: === Iteration 133 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 133788243, now seen corresponding path program 1 times [2019-09-10 08:34:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:47,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:47,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:47,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:48,080 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 08:34:48,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:48,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:34:48,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:48,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:34:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:34:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:34:48,081 INFO L87 Difference]: Start difference. First operand 820 states and 1009 transitions. Second operand 17 states. [2019-09-10 08:34:48,772 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:34:48,933 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:34:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:50,490 INFO L93 Difference]: Finished difference Result 1594 states and 2076 transitions. [2019-09-10 08:34:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:34:50,490 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 127 [2019-09-10 08:34:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:50,491 INFO L225 Difference]: With dead ends: 1594 [2019-09-10 08:34:50,491 INFO L226 Difference]: Without dead ends: 1594 [2019-09-10 08:34:50,492 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 08:34:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-09-10 08:34:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 785. [2019-09-10 08:34:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-10 08:34:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 968 transitions. [2019-09-10 08:34:50,498 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 968 transitions. Word has length 127 [2019-09-10 08:34:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:50,499 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 968 transitions. [2019-09-10 08:34:50,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:34:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 968 transitions. [2019-09-10 08:34:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:50,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:50,499 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, 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 08:34:50,500 INFO L418 AbstractCegarLoop]: === Iteration 134 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -960693953, now seen corresponding path program 1 times [2019-09-10 08:34:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:50,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:51,240 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 08:34:51,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:51,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:34:51,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:51,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:34:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:34:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:34:51,241 INFO L87 Difference]: Start difference. First operand 785 states and 968 transitions. Second operand 13 states. [2019-09-10 08:34:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:52,850 INFO L93 Difference]: Finished difference Result 2534 states and 3435 transitions. [2019-09-10 08:34:52,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:34:52,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 08:34:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:52,853 INFO L225 Difference]: With dead ends: 2534 [2019-09-10 08:34:52,853 INFO L226 Difference]: Without dead ends: 2534 [2019-09-10 08:34:52,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:34:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2019-09-10 08:34:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 751. [2019-09-10 08:34:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-10 08:34:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 927 transitions. [2019-09-10 08:34:52,864 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 927 transitions. Word has length 127 [2019-09-10 08:34:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:52,864 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 927 transitions. [2019-09-10 08:34:52,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:34:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 927 transitions. [2019-09-10 08:34:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:52,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:52,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, 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 08:34:52,865 INFO L418 AbstractCegarLoop]: === Iteration 135 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:52,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:52,865 INFO L82 PathProgramCache]: Analyzing trace with hash -666133872, now seen corresponding path program 1 times [2019-09-10 08:34:52,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:52,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:52,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:52,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:52,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:53,472 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 08:34:53,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:53,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:34:53,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:53,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:34:53,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:34:53,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:34:53,473 INFO L87 Difference]: Start difference. First operand 751 states and 927 transitions. Second operand 12 states. [2019-09-10 08:34:53,960 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-10 08:34:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:54,876 INFO L93 Difference]: Finished difference Result 1104 states and 1388 transitions. [2019-09-10 08:34:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:34:54,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2019-09-10 08:34:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:54,878 INFO L225 Difference]: With dead ends: 1104 [2019-09-10 08:34:54,879 INFO L226 Difference]: Without dead ends: 1104 [2019-09-10 08:34:54,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:34:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-09-10 08:34:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 718. [2019-09-10 08:34:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-09-10 08:34:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 882 transitions. [2019-09-10 08:34:54,885 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 882 transitions. Word has length 127 [2019-09-10 08:34:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:54,885 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 882 transitions. [2019-09-10 08:34:54,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:34:54,885 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 882 transitions. [2019-09-10 08:34:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:54,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:54,886 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, 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 08:34:54,886 INFO L418 AbstractCegarLoop]: === Iteration 136 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1422527876, now seen corresponding path program 1 times [2019-09-10 08:34:54,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:55,322 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 08:34:55,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:55,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:34:55,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:55,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:34:55,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:34:55,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:34:55,323 INFO L87 Difference]: Start difference. First operand 718 states and 882 transitions. Second operand 11 states. [2019-09-10 08:34:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:56,364 INFO L93 Difference]: Finished difference Result 2253 states and 3097 transitions. [2019-09-10 08:34:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:34:56,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-10 08:34:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:56,366 INFO L225 Difference]: With dead ends: 2253 [2019-09-10 08:34:56,366 INFO L226 Difference]: Without dead ends: 2253 [2019-09-10 08:34:56,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:34:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-09-10 08:34:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 662. [2019-09-10 08:34:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-09-10 08:34:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 813 transitions. [2019-09-10 08:34:56,376 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 813 transitions. Word has length 127 [2019-09-10 08:34:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:56,376 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 813 transitions. [2019-09-10 08:34:56,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:34:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 813 transitions. [2019-09-10 08:34:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:56,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:56,377 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, 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 08:34:56,377 INFO L418 AbstractCegarLoop]: === Iteration 137 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -662317091, now seen corresponding path program 1 times [2019-09-10 08:34:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:56,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:56,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:56,855 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 08:34:56,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:56,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:34:56,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:56,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:34:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:34:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:34:56,856 INFO L87 Difference]: Start difference. First operand 662 states and 813 transitions. Second operand 12 states. [2019-09-10 08:34:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:57,994 INFO L93 Difference]: Finished difference Result 1796 states and 2408 transitions. [2019-09-10 08:34:57,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:34:57,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 127 [2019-09-10 08:34:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:57,995 INFO L225 Difference]: With dead ends: 1796 [2019-09-10 08:34:57,995 INFO L226 Difference]: Without dead ends: 1796 [2019-09-10 08:34:57,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:34:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2019-09-10 08:34:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 506. [2019-09-10 08:34:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-10 08:34:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 628 transitions. [2019-09-10 08:34:58,002 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 628 transitions. Word has length 127 [2019-09-10 08:34:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:58,002 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 628 transitions. [2019-09-10 08:34:58,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:34:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 628 transitions. [2019-09-10 08:34:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 08:34:58,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:58,003 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, 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 08:34:58,003 INFO L418 AbstractCegarLoop]: === Iteration 138 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2033677576, now seen corresponding path program 1 times [2019-09-10 08:34:58,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:58,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:58,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:59,619 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 08:34:59,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:59,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:34:59,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:59,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:34:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:34:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:34:59,621 INFO L87 Difference]: Start difference. First operand 506 states and 628 transitions. Second operand 26 states. [2019-09-10 08:35:00,947 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-10 08:35:01,176 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-10 08:35:01,486 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-10 08:35:01,675 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:35:01,859 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-10 08:35:02,101 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:35:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:04,294 INFO L93 Difference]: Finished difference Result 1090 states and 1400 transitions. [2019-09-10 08:35:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 08:35:04,294 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2019-09-10 08:35:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:04,296 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 08:35:04,296 INFO L226 Difference]: Without dead ends: 1090 [2019-09-10 08:35:04,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=399, Invalid=1953, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 08:35:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-10 08:35:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 537. [2019-09-10 08:35:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-09-10 08:35:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 665 transitions. [2019-09-10 08:35:04,302 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 665 transitions. Word has length 127 [2019-09-10 08:35:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:04,302 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 665 transitions. [2019-09-10 08:35:04,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:35:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 665 transitions. [2019-09-10 08:35:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:35:04,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:04,303 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, 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 08:35:04,303 INFO L418 AbstractCegarLoop]: === Iteration 139 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1656199613, now seen corresponding path program 1 times [2019-09-10 08:35:04,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:04,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:04,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:04,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:04,866 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 08:35:04,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:04,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:35:04,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:04,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:35:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:35:04,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:35:04,867 INFO L87 Difference]: Start difference. First operand 537 states and 665 transitions. Second operand 14 states. [2019-09-10 08:35:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:06,263 INFO L93 Difference]: Finished difference Result 804 states and 1026 transitions. [2019-09-10 08:35:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:35:06,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 128 [2019-09-10 08:35:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:06,267 INFO L225 Difference]: With dead ends: 804 [2019-09-10 08:35:06,267 INFO L226 Difference]: Without dead ends: 801 [2019-09-10 08:35:06,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:35:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-10 08:35:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 526. [2019-09-10 08:35:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-09-10 08:35:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 653 transitions. [2019-09-10 08:35:06,273 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 653 transitions. Word has length 128 [2019-09-10 08:35:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:06,273 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 653 transitions. [2019-09-10 08:35:06,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:35:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 653 transitions. [2019-09-10 08:35:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:35:06,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:06,274 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, 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 08:35:06,275 INFO L418 AbstractCegarLoop]: === Iteration 140 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:06,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:06,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1860453958, now seen corresponding path program 1 times [2019-09-10 08:35:06,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:06,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:06,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:06,732 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-10 08:35:07,104 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 08:35:07,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:07,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:35:07,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:07,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:35:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:35:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:35:07,105 INFO L87 Difference]: Start difference. First operand 526 states and 653 transitions. Second operand 13 states. [2019-09-10 08:35:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:08,322 INFO L93 Difference]: Finished difference Result 1064 states and 1386 transitions. [2019-09-10 08:35:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:35:08,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-10 08:35:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:08,325 INFO L225 Difference]: With dead ends: 1064 [2019-09-10 08:35:08,326 INFO L226 Difference]: Without dead ends: 1064 [2019-09-10 08:35:08,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:35:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-09-10 08:35:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 508. [2019-09-10 08:35:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-10 08:35:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 633 transitions. [2019-09-10 08:35:08,332 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 633 transitions. Word has length 128 [2019-09-10 08:35:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:08,332 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 633 transitions. [2019-09-10 08:35:08,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:35:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 633 transitions. [2019-09-10 08:35:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:35:08,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:08,333 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, 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 08:35:08,333 INFO L418 AbstractCegarLoop]: === Iteration 141 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1007623233, now seen corresponding path program 1 times [2019-09-10 08:35:08,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:08,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:08,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:08,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:08,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:08,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:35:08,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:08,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:35:08,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:35:08,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:35:08,829 INFO L87 Difference]: Start difference. First operand 508 states and 633 transitions. Second operand 12 states. [2019-09-10 08:35:09,338 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:35:09,472 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:35:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:10,226 INFO L93 Difference]: Finished difference Result 1431 states and 1921 transitions. [2019-09-10 08:35:10,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:35:10,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-10 08:35:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:10,229 INFO L225 Difference]: With dead ends: 1431 [2019-09-10 08:35:10,229 INFO L226 Difference]: Without dead ends: 1431 [2019-09-10 08:35:10,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:35:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-10 08:35:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 426. [2019-09-10 08:35:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:35:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 535 transitions. [2019-09-10 08:35:10,235 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 535 transitions. Word has length 128 [2019-09-10 08:35:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:10,235 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 535 transitions. [2019-09-10 08:35:10,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:35:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 535 transitions. [2019-09-10 08:35:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:35:10,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:10,266 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, 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 08:35:10,266 INFO L418 AbstractCegarLoop]: === Iteration 142 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -789644279, now seen corresponding path program 1 times [2019-09-10 08:35:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:10,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:10,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:10,492 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 08:35:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:10,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:10,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:10,493 INFO L87 Difference]: Start difference. First operand 426 states and 535 transitions. Second operand 9 states. [2019-09-10 08:35:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:11,459 INFO L93 Difference]: Finished difference Result 686 states and 887 transitions. [2019-09-10 08:35:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:35:11,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 08:35:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:11,460 INFO L225 Difference]: With dead ends: 686 [2019-09-10 08:35:11,460 INFO L226 Difference]: Without dead ends: 686 [2019-09-10 08:35:11,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:35:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-09-10 08:35:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 426. [2019-09-10 08:35:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:35:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 533 transitions. [2019-09-10 08:35:11,464 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 533 transitions. Word has length 128 [2019-09-10 08:35:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:11,465 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 533 transitions. [2019-09-10 08:35:11,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 533 transitions. [2019-09-10 08:35:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 08:35:11,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:11,465 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, 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 08:35:11,466 INFO L418 AbstractCegarLoop]: === Iteration 143 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:11,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1300753321, now seen corresponding path program 1 times [2019-09-10 08:35:11,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:11,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:11,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:11,703 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 08:35:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:11,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:11,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:11,704 INFO L87 Difference]: Start difference. First operand 426 states and 533 transitions. Second operand 9 states. [2019-09-10 08:35:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:12,598 INFO L93 Difference]: Finished difference Result 652 states and 846 transitions. [2019-09-10 08:35:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:35:12,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-10 08:35:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:12,600 INFO L225 Difference]: With dead ends: 652 [2019-09-10 08:35:12,600 INFO L226 Difference]: Without dead ends: 652 [2019-09-10 08:35:12,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:35:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-10 08:35:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 426. [2019-09-10 08:35:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:35:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 532 transitions. [2019-09-10 08:35:12,604 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 532 transitions. Word has length 128 [2019-09-10 08:35:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:12,604 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 532 transitions. [2019-09-10 08:35:12,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 532 transitions. [2019-09-10 08:35:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:35:12,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:12,605 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, 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 08:35:12,605 INFO L418 AbstractCegarLoop]: === Iteration 144 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1284634217, now seen corresponding path program 1 times [2019-09-10 08:35:12,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:12,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:12,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:12,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:12,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:12,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:35:12,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:12,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:35:12,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:35:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:35:12,829 INFO L87 Difference]: Start difference. First operand 426 states and 532 transitions. Second operand 9 states. [2019-09-10 08:35:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:13,797 INFO L93 Difference]: Finished difference Result 652 states and 844 transitions. [2019-09-10 08:35:13,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:35:13,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2019-09-10 08:35:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:13,799 INFO L225 Difference]: With dead ends: 652 [2019-09-10 08:35:13,799 INFO L226 Difference]: Without dead ends: 652 [2019-09-10 08:35:13,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:35:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-10 08:35:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 426. [2019-09-10 08:35:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 08:35:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 531 transitions. [2019-09-10 08:35:13,803 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 531 transitions. Word has length 129 [2019-09-10 08:35:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:13,803 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 531 transitions. [2019-09-10 08:35:13,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:35:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 531 transitions. [2019-09-10 08:35:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:35:13,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:13,804 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, 1, 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 08:35:13,804 INFO L418 AbstractCegarLoop]: === Iteration 145 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:13,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:13,804 INFO L82 PathProgramCache]: Analyzing trace with hash 252766446, now seen corresponding path program 1 times [2019-09-10 08:35:13,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:13,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:13,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:13,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:15,971 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 08:35:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:15,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2019-09-10 08:35:15,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:15,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-10 08:35:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-10 08:35:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:35:15,972 INFO L87 Difference]: Start difference. First operand 426 states and 531 transitions. Second operand 37 states. [2019-09-10 08:35:16,558 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 149 [2019-09-10 08:35:18,582 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-10 08:35:18,834 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 08:35:19,128 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-09-10 08:35:19,479 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-09-10 08:35:19,891 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2019-09-10 08:35:20,415 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2019-09-10 08:35:20,690 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-10 08:35:20,958 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-09-10 08:35:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:25,794 INFO L93 Difference]: Finished difference Result 949 states and 1230 transitions. [2019-09-10 08:35:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-10 08:35:25,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 130 [2019-09-10 08:35:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:25,797 INFO L225 Difference]: With dead ends: 949 [2019-09-10 08:35:25,797 INFO L226 Difference]: Without dead ends: 949 [2019-09-10 08:35:25,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=711, Invalid=4259, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:35:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-10 08:35:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 457. [2019-09-10 08:35:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-09-10 08:35:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 568 transitions. [2019-09-10 08:35:25,802 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 568 transitions. Word has length 130 [2019-09-10 08:35:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:25,802 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 568 transitions. [2019-09-10 08:35:25,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-10 08:35:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 568 transitions. [2019-09-10 08:35:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 08:35:25,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:25,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:25,803 INFO L418 AbstractCegarLoop]: === Iteration 146 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1769114930, now seen corresponding path program 1 times [2019-09-10 08:35:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:25,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:27,290 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 08:35:27,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:27,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-09-10 08:35:27,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:27,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-10 08:35:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-10 08:35:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 08:35:27,291 INFO L87 Difference]: Start difference. First operand 457 states and 568 transitions. Second operand 36 states. [2019-09-10 08:35:27,797 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 137 [2019-09-10 08:35:30,006 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-09-10 08:35:30,293 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-10 08:35:30,647 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2019-09-10 08:35:31,041 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2019-09-10 08:35:31,478 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2019-09-10 08:35:31,971 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 116 [2019-09-10 08:35:32,218 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 08:35:32,444 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-10 08:35:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:36,711 INFO L93 Difference]: Finished difference Result 605 states and 721 transitions. [2019-09-10 08:35:36,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:35:36,712 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130 [2019-09-10 08:35:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:36,713 INFO L225 Difference]: With dead ends: 605 [2019-09-10 08:35:36,713 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 08:35:36,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=662, Invalid=4030, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 08:35:36,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 08:35:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 461. [2019-09-10 08:35:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-09-10 08:35:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 573 transitions. [2019-09-10 08:35:36,718 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 573 transitions. Word has length 130 [2019-09-10 08:35:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:36,718 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 573 transitions. [2019-09-10 08:35:36,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-10 08:35:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 573 transitions. [2019-09-10 08:35:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:35:36,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:36,719 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, 1, 1, 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 08:35:36,719 INFO L418 AbstractCegarLoop]: === Iteration 147 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1225477604, now seen corresponding path program 1 times [2019-09-10 08:35:36,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:36,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:37,446 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 08:35:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:35:37,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:37,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:35:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:35:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:37,447 INFO L87 Difference]: Start difference. First operand 461 states and 573 transitions. Second operand 15 states. [2019-09-10 08:35:38,132 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-10 08:35:38,282 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:35:38,418 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 08:35:38,549 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:35:38,706 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-10 08:35:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:39,073 INFO L93 Difference]: Finished difference Result 416 states and 523 transitions. [2019-09-10 08:35:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:35:39,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 131 [2019-09-10 08:35:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:39,074 INFO L225 Difference]: With dead ends: 416 [2019-09-10 08:35:39,074 INFO L226 Difference]: Without dead ends: 413 [2019-09-10 08:35:39,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:35:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-10 08:35:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-09-10 08:35:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-09-10 08:35:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 520 transitions. [2019-09-10 08:35:39,079 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 520 transitions. Word has length 131 [2019-09-10 08:35:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:39,079 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 520 transitions. [2019-09-10 08:35:39,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:35:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 520 transitions. [2019-09-10 08:35:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:35:39,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:39,079 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, 1, 1, 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 08:35:39,080 INFO L418 AbstractCegarLoop]: === Iteration 148 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 350079765, now seen corresponding path program 1 times [2019-09-10 08:35:39,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:39,990 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 08:35:39,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:39,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:35:39,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:39,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:35:39,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:35:39,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:35:39,991 INFO L87 Difference]: Start difference. First operand 413 states and 520 transitions. Second operand 13 states. [2019-09-10 08:35:40,672 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:35:40,833 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-10 08:35:41,103 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-10 08:35:41,309 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-09-10 08:35:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:41,743 INFO L93 Difference]: Finished difference Result 1696 states and 2379 transitions. [2019-09-10 08:35:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:41,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 131 [2019-09-10 08:35:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:41,747 INFO L225 Difference]: With dead ends: 1696 [2019-09-10 08:35:41,747 INFO L226 Difference]: Without dead ends: 1696 [2019-09-10 08:35:41,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:35:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-09-10 08:35:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 400. [2019-09-10 08:35:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 08:35:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 504 transitions. [2019-09-10 08:35:41,754 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 504 transitions. Word has length 131 [2019-09-10 08:35:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:41,755 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 504 transitions. [2019-09-10 08:35:41,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:35:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 504 transitions. [2019-09-10 08:35:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:35:41,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:41,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, 1, 1, 1, 1, 1, 1, 1, 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 08:35:41,755 INFO L418 AbstractCegarLoop]: === Iteration 149 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:41,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1671801611, now seen corresponding path program 1 times [2019-09-10 08:35:41,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:41,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:41,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:41,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:42,590 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 08:35:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:42,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:42,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:42,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:42,591 INFO L87 Difference]: Start difference. First operand 400 states and 504 transitions. Second operand 17 states. [2019-09-10 08:35:43,378 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 08:35:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:44,550 INFO L93 Difference]: Finished difference Result 635 states and 827 transitions. [2019-09-10 08:35:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:35:44,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2019-09-10 08:35:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:44,552 INFO L225 Difference]: With dead ends: 635 [2019-09-10 08:35:44,552 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 08:35:44,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:35:44,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 08:35:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 372. [2019-09-10 08:35:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-10 08:35:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 470 transitions. [2019-09-10 08:35:44,556 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 470 transitions. Word has length 131 [2019-09-10 08:35:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:44,556 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 470 transitions. [2019-09-10 08:35:44,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 470 transitions. [2019-09-10 08:35:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:35:44,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:44,557 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, 1, 1, 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 08:35:44,557 INFO L418 AbstractCegarLoop]: === Iteration 150 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash 247803993, now seen corresponding path program 1 times [2019-09-10 08:35:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:44,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:45,417 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 08:35:45,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:45,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:35:45,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:45,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:35:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:35:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:35:45,418 INFO L87 Difference]: Start difference. First operand 372 states and 470 transitions. Second operand 17 states. [2019-09-10 08:35:46,375 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:35:46,562 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-10 08:35:46,712 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 08:35:46,893 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:35:47,073 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:35:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:47,790 INFO L93 Difference]: Finished difference Result 773 states and 1042 transitions. [2019-09-10 08:35:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:35:47,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 131 [2019-09-10 08:35:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:47,791 INFO L225 Difference]: With dead ends: 773 [2019-09-10 08:35:47,791 INFO L226 Difference]: Without dead ends: 767 [2019-09-10 08:35:47,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:35:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-09-10 08:35:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 359. [2019-09-10 08:35:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-10 08:35:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 456 transitions. [2019-09-10 08:35:47,796 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 456 transitions. Word has length 131 [2019-09-10 08:35:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:47,796 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 456 transitions. [2019-09-10 08:35:47,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:35:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 456 transitions. [2019-09-10 08:35:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 08:35:47,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:47,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:47,797 INFO L418 AbstractCegarLoop]: === Iteration 151 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -180433450, now seen corresponding path program 1 times [2019-09-10 08:35:47,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:47,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:47,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:47,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:47,986 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 08:35:47,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:47,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:35:47,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:47,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:35:47,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:35:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:47,987 INFO L87 Difference]: Start difference. First operand 359 states and 456 transitions. Second operand 3 states. [2019-09-10 08:35:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:48,031 INFO L93 Difference]: Finished difference Result 521 states and 690 transitions. [2019-09-10 08:35:48,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:48,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 08:35:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:48,032 INFO L225 Difference]: With dead ends: 521 [2019-09-10 08:35:48,033 INFO L226 Difference]: Without dead ends: 521 [2019-09-10 08:35:48,033 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 08:35:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-09-10 08:35:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2019-09-10 08:35:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-10 08:35:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 689 transitions. [2019-09-10 08:35:48,038 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 689 transitions. Word has length 168 [2019-09-10 08:35:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:48,039 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 689 transitions. [2019-09-10 08:35:48,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:35:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 689 transitions. [2019-09-10 08:35:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:48,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:48,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:48,040 INFO L418 AbstractCegarLoop]: === Iteration 152 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:48,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:48,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1863573619, now seen corresponding path program 1 times [2019-09-10 08:35:48,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:48,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:48,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:48,971 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 08:35:48,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:48,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:48,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:48,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:48,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:48,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:48,972 INFO L87 Difference]: Start difference. First operand 519 states and 689 transitions. Second operand 7 states. [2019-09-10 08:35:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:49,573 INFO L93 Difference]: Finished difference Result 1949 states and 2768 transitions. [2019-09-10 08:35:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:49,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:49,576 INFO L225 Difference]: With dead ends: 1949 [2019-09-10 08:35:49,577 INFO L226 Difference]: Without dead ends: 1949 [2019-09-10 08:35:49,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-09-10 08:35:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 887. [2019-09-10 08:35:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-10 08:35:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1229 transitions. [2019-09-10 08:35:49,591 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1229 transitions. Word has length 170 [2019-09-10 08:35:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:49,591 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1229 transitions. [2019-09-10 08:35:49,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:49,591 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1229 transitions. [2019-09-10 08:35:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:49,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:49,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:49,593 INFO L418 AbstractCegarLoop]: === Iteration 153 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 172365062, now seen corresponding path program 1 times [2019-09-10 08:35:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:49,811 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 08:35:49,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:49,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:35:49,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:49,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:35:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:35:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:49,812 INFO L87 Difference]: Start difference. First operand 887 states and 1229 transitions. Second operand 3 states. [2019-09-10 08:35:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:49,845 INFO L93 Difference]: Finished difference Result 1231 states and 1719 transitions. [2019-09-10 08:35:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:49,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:35:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:49,846 INFO L225 Difference]: With dead ends: 1231 [2019-09-10 08:35:49,847 INFO L226 Difference]: Without dead ends: 1231 [2019-09-10 08:35:49,847 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 08:35:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-09-10 08:35:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1229. [2019-09-10 08:35:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-09-10 08:35:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1718 transitions. [2019-09-10 08:35:49,856 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1718 transitions. Word has length 170 [2019-09-10 08:35:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:49,856 INFO L475 AbstractCegarLoop]: Abstraction has 1229 states and 1718 transitions. [2019-09-10 08:35:49,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:35:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1718 transitions. [2019-09-10 08:35:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:49,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:49,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:49,858 INFO L418 AbstractCegarLoop]: === Iteration 154 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash 238858574, now seen corresponding path program 1 times [2019-09-10 08:35:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:49,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:50,046 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 08:35:50,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:35:50,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:50,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:35:50,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:35:50,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:35:50,047 INFO L87 Difference]: Start difference. First operand 1229 states and 1718 transitions. Second operand 3 states. [2019-09-10 08:35:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:50,099 INFO L93 Difference]: Finished difference Result 1773 states and 2497 transitions. [2019-09-10 08:35:50,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:50,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-10 08:35:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:50,100 INFO L225 Difference]: With dead ends: 1773 [2019-09-10 08:35:50,100 INFO L226 Difference]: Without dead ends: 1773 [2019-09-10 08:35:50,101 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 08:35:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-09-10 08:35:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1771. [2019-09-10 08:35:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-09-10 08:35:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2496 transitions. [2019-09-10 08:35:50,112 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2496 transitions. Word has length 170 [2019-09-10 08:35:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:50,113 INFO L475 AbstractCegarLoop]: Abstraction has 1771 states and 2496 transitions. [2019-09-10 08:35:50,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:35:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2496 transitions. [2019-09-10 08:35:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:50,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:50,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:50,114 INFO L418 AbstractCegarLoop]: === Iteration 155 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 408482463, now seen corresponding path program 1 times [2019-09-10 08:35:50,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:50,332 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 08:35:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:50,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:50,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:50,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:50,333 INFO L87 Difference]: Start difference. First operand 1771 states and 2496 transitions. Second operand 7 states. [2019-09-10 08:35:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:50,921 INFO L93 Difference]: Finished difference Result 6733 states and 9516 transitions. [2019-09-10 08:35:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:50,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:50,926 INFO L225 Difference]: With dead ends: 6733 [2019-09-10 08:35:50,927 INFO L226 Difference]: Without dead ends: 6733 [2019-09-10 08:35:50,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2019-09-10 08:35:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 3567. [2019-09-10 08:35:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3567 states. [2019-09-10 08:35:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3567 states to 3567 states and 5075 transitions. [2019-09-10 08:35:50,957 INFO L78 Accepts]: Start accepts. Automaton has 3567 states and 5075 transitions. Word has length 170 [2019-09-10 08:35:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:50,957 INFO L475 AbstractCegarLoop]: Abstraction has 3567 states and 5075 transitions. [2019-09-10 08:35:50,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 5075 transitions. [2019-09-10 08:35:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:50,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:50,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:50,959 INFO L418 AbstractCegarLoop]: === Iteration 156 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1801852813, now seen corresponding path program 1 times [2019-09-10 08:35:50,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:50,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:51,234 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 08:35:51,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:51,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:51,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:51,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:51,235 INFO L87 Difference]: Start difference. First operand 3567 states and 5075 transitions. Second operand 7 states. [2019-09-10 08:35:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:51,835 INFO L93 Difference]: Finished difference Result 11441 states and 16222 transitions. [2019-09-10 08:35:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:51,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:51,846 INFO L225 Difference]: With dead ends: 11441 [2019-09-10 08:35:51,847 INFO L226 Difference]: Without dead ends: 11441 [2019-09-10 08:35:51,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11441 states. [2019-09-10 08:35:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11441 to 7303. [2019-09-10 08:35:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2019-09-10 08:35:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 10449 transitions. [2019-09-10 08:35:51,910 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 10449 transitions. Word has length 170 [2019-09-10 08:35:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:51,910 INFO L475 AbstractCegarLoop]: Abstraction has 7303 states and 10449 transitions. [2019-09-10 08:35:51,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 10449 transitions. [2019-09-10 08:35:51,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:51,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:51,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:51,912 INFO L418 AbstractCegarLoop]: === Iteration 157 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:51,912 INFO L82 PathProgramCache]: Analyzing trace with hash -499050099, now seen corresponding path program 1 times [2019-09-10 08:35:51,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:51,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:51,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:51,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:51,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:52,127 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 08:35:52,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:52,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:52,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:52,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:52,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:52,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:52,128 INFO L87 Difference]: Start difference. First operand 7303 states and 10449 transitions. Second operand 7 states. [2019-09-10 08:35:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:52,751 INFO L93 Difference]: Finished difference Result 24845 states and 35332 transitions. [2019-09-10 08:35:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:52,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:52,772 INFO L225 Difference]: With dead ends: 24845 [2019-09-10 08:35:52,772 INFO L226 Difference]: Without dead ends: 24845 [2019-09-10 08:35:52,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24845 states. [2019-09-10 08:35:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24845 to 15135. [2019-09-10 08:35:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2019-09-10 08:35:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 21701 transitions. [2019-09-10 08:35:52,918 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 21701 transitions. Word has length 170 [2019-09-10 08:35:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:52,918 INFO L475 AbstractCegarLoop]: Abstraction has 15135 states and 21701 transitions. [2019-09-10 08:35:52,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 21701 transitions. [2019-09-10 08:35:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:52,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:52,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:52,920 INFO L418 AbstractCegarLoop]: === Iteration 158 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1882514547, now seen corresponding path program 1 times [2019-09-10 08:35:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:52,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:53,131 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 08:35:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:53,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:53,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:53,132 INFO L87 Difference]: Start difference. First operand 15135 states and 21701 transitions. Second operand 7 states. [2019-09-10 08:35:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:53,804 INFO L93 Difference]: Finished difference Result 53813 states and 76648 transitions. [2019-09-10 08:35:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:53,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:53,850 INFO L225 Difference]: With dead ends: 53813 [2019-09-10 08:35:53,850 INFO L226 Difference]: Without dead ends: 53813 [2019-09-10 08:35:53,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53813 states. [2019-09-10 08:35:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53813 to 31519. [2019-09-10 08:35:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31519 states. [2019-09-10 08:35:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31519 states to 31519 states and 45213 transitions. [2019-09-10 08:35:54,281 INFO L78 Accepts]: Start accepts. Automaton has 31519 states and 45213 transitions. Word has length 170 [2019-09-10 08:35:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:54,282 INFO L475 AbstractCegarLoop]: Abstraction has 31519 states and 45213 transitions. [2019-09-10 08:35:54,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31519 states and 45213 transitions. [2019-09-10 08:35:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:54,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:54,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:54,285 INFO L418 AbstractCegarLoop]: === Iteration 159 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2071716467, now seen corresponding path program 1 times [2019-09-10 08:35:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:54,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:54,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:54,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:54,500 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 08:35:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:54,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:54,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:54,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:54,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:54,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:54,501 INFO L87 Difference]: Start difference. First operand 31519 states and 45213 transitions. Second operand 7 states. [2019-09-10 08:35:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:55,293 INFO L93 Difference]: Finished difference Result 116069 states and 165472 transitions. [2019-09-10 08:35:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:55,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:55,399 INFO L225 Difference]: With dead ends: 116069 [2019-09-10 08:35:55,399 INFO L226 Difference]: Without dead ends: 116069 [2019-09-10 08:35:55,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116069 states. [2019-09-10 08:35:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116069 to 65727. [2019-09-10 08:35:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65727 states. [2019-09-10 08:35:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65727 states to 65727 states and 94253 transitions. [2019-09-10 08:35:57,519 INFO L78 Accepts]: Start accepts. Automaton has 65727 states and 94253 transitions. Word has length 170 [2019-09-10 08:35:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:57,520 INFO L475 AbstractCegarLoop]: Abstraction has 65727 states and 94253 transitions. [2019-09-10 08:35:57,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 65727 states and 94253 transitions. [2019-09-10 08:35:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 08:35:57,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:57,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:57,526 INFO L418 AbstractCegarLoop]: === Iteration 160 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1166221709, now seen corresponding path program 1 times [2019-09-10 08:35:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:57,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:57,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:57,744 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 08:35:57,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:57,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:35:57,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:57,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:35:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:35:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:35:57,745 INFO L87 Difference]: Start difference. First operand 65727 states and 94253 transitions. Second operand 7 states. [2019-09-10 08:35:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:58,489 INFO L93 Difference]: Finished difference Result 139333 states and 197008 transitions. [2019-09-10 08:35:58,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:35:58,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-10 08:35:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:58,615 INFO L225 Difference]: With dead ends: 139333 [2019-09-10 08:35:58,616 INFO L226 Difference]: Without dead ends: 139333 [2019-09-10 08:35:58,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:35:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139333 states. [2019-09-10 08:35:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139333 to 75007. [2019-09-10 08:35:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75007 states. [2019-09-10 08:35:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75007 states to 75007 states and 106157 transitions. [2019-09-10 08:35:59,850 INFO L78 Accepts]: Start accepts. Automaton has 75007 states and 106157 transitions. Word has length 170 [2019-09-10 08:35:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:59,850 INFO L475 AbstractCegarLoop]: Abstraction has 75007 states and 106157 transitions. [2019-09-10 08:35:59,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:35:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75007 states and 106157 transitions. [2019-09-10 08:35:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 08:35:59,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:59,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:35:59,855 INFO L418 AbstractCegarLoop]: === Iteration 161 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:59,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1063499740, now seen corresponding path program 1 times [2019-09-10 08:35:59,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:59,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:59,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:00,032 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 08:36:00,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:00,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:00,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:00,034 INFO L87 Difference]: Start difference. First operand 75007 states and 106157 transitions. Second operand 3 states. [2019-09-10 08:36:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:00,179 INFO L93 Difference]: Finished difference Result 71649 states and 100558 transitions. [2019-09-10 08:36:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:00,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-10 08:36:00,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:00,238 INFO L225 Difference]: With dead ends: 71649 [2019-09-10 08:36:00,239 INFO L226 Difference]: Without dead ends: 71649 [2019-09-10 08:36:00,239 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 08:36:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71649 states. [2019-09-10 08:36:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71649 to 58751. [2019-09-10 08:36:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58751 states. [2019-09-10 08:36:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58751 states to 58751 states and 82461 transitions. [2019-09-10 08:36:00,757 INFO L78 Accepts]: Start accepts. Automaton has 58751 states and 82461 transitions. Word has length 171 [2019-09-10 08:36:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:00,757 INFO L475 AbstractCegarLoop]: Abstraction has 58751 states and 82461 transitions. [2019-09-10 08:36:00,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 58751 states and 82461 transitions. [2019-09-10 08:36:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-10 08:36:00,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:00,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:00,761 INFO L418 AbstractCegarLoop]: === Iteration 162 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1513602695, now seen corresponding path program 1 times [2019-09-10 08:36:00,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:00,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:00,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:00,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:00,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:02,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 08:36:02,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:02,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:02,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:02,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:02,922 INFO L87 Difference]: Start difference. First operand 58751 states and 82461 transitions. Second operand 3 states. [2019-09-10 08:36:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:03,044 INFO L93 Difference]: Finished difference Result 55873 states and 77662 transitions. [2019-09-10 08:36:03,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:03,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-10 08:36:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:03,091 INFO L225 Difference]: With dead ends: 55873 [2019-09-10 08:36:03,091 INFO L226 Difference]: Without dead ends: 55873 [2019-09-10 08:36:03,091 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 08:36:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55873 states. [2019-09-10 08:36:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55873 to 42311. [2019-09-10 08:36:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42311 states. [2019-09-10 08:36:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42311 states to 42311 states and 58777 transitions. [2019-09-10 08:36:03,458 INFO L78 Accepts]: Start accepts. Automaton has 42311 states and 58777 transitions. Word has length 172 [2019-09-10 08:36:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:03,458 INFO L475 AbstractCegarLoop]: Abstraction has 42311 states and 58777 transitions. [2019-09-10 08:36:03,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42311 states and 58777 transitions. [2019-09-10 08:36:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 08:36:03,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:03,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:03,460 INFO L418 AbstractCegarLoop]: === Iteration 163 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2120667968, now seen corresponding path program 1 times [2019-09-10 08:36:03,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:03,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:03,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:03,648 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 08:36:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:03,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:03,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:03,649 INFO L87 Difference]: Start difference. First operand 42311 states and 58777 transitions. Second operand 3 states. [2019-09-10 08:36:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:03,788 INFO L93 Difference]: Finished difference Result 70753 states and 98054 transitions. [2019-09-10 08:36:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:03,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 08:36:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:03,848 INFO L225 Difference]: With dead ends: 70753 [2019-09-10 08:36:03,848 INFO L226 Difference]: Without dead ends: 70753 [2019-09-10 08:36:03,848 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 08:36:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70753 states. [2019-09-10 08:36:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70753 to 51815. [2019-09-10 08:36:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51815 states. [2019-09-10 08:36:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51815 states to 51815 states and 72043 transitions. [2019-09-10 08:36:04,575 INFO L78 Accepts]: Start accepts. Automaton has 51815 states and 72043 transitions. Word has length 173 [2019-09-10 08:36:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:04,575 INFO L475 AbstractCegarLoop]: Abstraction has 51815 states and 72043 transitions. [2019-09-10 08:36:04,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 51815 states and 72043 transitions. [2019-09-10 08:36:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 08:36:04,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:04,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:04,577 INFO L418 AbstractCegarLoop]: === Iteration 164 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 70303414, now seen corresponding path program 1 times [2019-09-10 08:36:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:04,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:04,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:04,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:04,755 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 08:36:04,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:04,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:04,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:04,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:04,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:04,756 INFO L87 Difference]: Start difference. First operand 51815 states and 72043 transitions. Second operand 3 states. [2019-09-10 08:36:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:04,893 INFO L93 Difference]: Finished difference Result 64165 states and 88370 transitions. [2019-09-10 08:36:04,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:04,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-10 08:36:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:04,947 INFO L225 Difference]: With dead ends: 64165 [2019-09-10 08:36:04,948 INFO L226 Difference]: Without dead ends: 64165 [2019-09-10 08:36:04,948 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 08:36:04,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64165 states. [2019-09-10 08:36:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64165 to 47765. [2019-09-10 08:36:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47765 states. [2019-09-10 08:36:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47765 states to 47765 states and 65833 transitions. [2019-09-10 08:36:05,350 INFO L78 Accepts]: Start accepts. Automaton has 47765 states and 65833 transitions. Word has length 174 [2019-09-10 08:36:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:05,350 INFO L475 AbstractCegarLoop]: Abstraction has 47765 states and 65833 transitions. [2019-09-10 08:36:05,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47765 states and 65833 transitions. [2019-09-10 08:36:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 08:36:05,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:05,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:05,352 INFO L418 AbstractCegarLoop]: === Iteration 165 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1740747395, now seen corresponding path program 1 times [2019-09-10 08:36:05,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:05,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:05,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:05,530 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 08:36:05,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:05,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:05,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:05,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:05,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:05,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:05,531 INFO L87 Difference]: Start difference. First operand 47765 states and 65833 transitions. Second operand 3 states. [2019-09-10 08:36:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:05,649 INFO L93 Difference]: Finished difference Result 59773 states and 81674 transitions. [2019-09-10 08:36:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:05,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 08:36:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:05,699 INFO L225 Difference]: With dead ends: 59773 [2019-09-10 08:36:05,699 INFO L226 Difference]: Without dead ends: 59773 [2019-09-10 08:36:05,700 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 08:36:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59773 states. [2019-09-10 08:36:06,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59773 to 57971. [2019-09-10 08:36:06,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57971 states. [2019-09-10 08:36:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57971 states to 57971 states and 79513 transitions. [2019-09-10 08:36:06,386 INFO L78 Accepts]: Start accepts. Automaton has 57971 states and 79513 transitions. Word has length 175 [2019-09-10 08:36:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:06,386 INFO L475 AbstractCegarLoop]: Abstraction has 57971 states and 79513 transitions. [2019-09-10 08:36:06,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 57971 states and 79513 transitions. [2019-09-10 08:36:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 08:36:06,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:06,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:06,387 INFO L418 AbstractCegarLoop]: === Iteration 166 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1045531862, now seen corresponding path program 1 times [2019-09-10 08:36:06,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:06,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:06,568 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 08:36:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:06,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:06,569 INFO L87 Difference]: Start difference. First operand 57971 states and 79513 transitions. Second operand 3 states. [2019-09-10 08:36:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:06,707 INFO L93 Difference]: Finished difference Result 67993 states and 92822 transitions. [2019-09-10 08:36:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:06,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 08:36:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:06,765 INFO L225 Difference]: With dead ends: 67993 [2019-09-10 08:36:06,765 INFO L226 Difference]: Without dead ends: 67993 [2019-09-10 08:36:06,765 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 08:36:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67993 states. [2019-09-10 08:36:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67993 to 67031. [2019-09-10 08:36:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67031 states. [2019-09-10 08:36:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67031 states to 67031 states and 91501 transitions. [2019-09-10 08:36:07,288 INFO L78 Accepts]: Start accepts. Automaton has 67031 states and 91501 transitions. Word has length 176 [2019-09-10 08:36:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:07,288 INFO L475 AbstractCegarLoop]: Abstraction has 67031 states and 91501 transitions. [2019-09-10 08:36:07,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 67031 states and 91501 transitions. [2019-09-10 08:36:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:36:07,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:07,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:07,289 INFO L418 AbstractCegarLoop]: === Iteration 167 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 931522231, now seen corresponding path program 1 times [2019-09-10 08:36:07,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:07,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:07,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:07,466 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 08:36:07,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:07,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:07,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:07,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:07,467 INFO L87 Difference]: Start difference. First operand 67031 states and 91501 transitions. Second operand 3 states. [2019-09-10 08:36:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:07,619 INFO L93 Difference]: Finished difference Result 73969 states and 100726 transitions. [2019-09-10 08:36:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:07,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 08:36:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:07,682 INFO L225 Difference]: With dead ends: 73969 [2019-09-10 08:36:07,682 INFO L226 Difference]: Without dead ends: 73969 [2019-09-10 08:36:07,682 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 08:36:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73969 states. [2019-09-10 08:36:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73969 to 73967. [2019-09-10 08:36:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73967 states. [2019-09-10 08:36:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73967 states to 73967 states and 100725 transitions. [2019-09-10 08:36:08,507 INFO L78 Accepts]: Start accepts. Automaton has 73967 states and 100725 transitions. Word has length 177 [2019-09-10 08:36:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:08,507 INFO L475 AbstractCegarLoop]: Abstraction has 73967 states and 100725 transitions. [2019-09-10 08:36:08,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 73967 states and 100725 transitions. [2019-09-10 08:36:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 08:36:08,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:08,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:08,508 INFO L418 AbstractCegarLoop]: === Iteration 168 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1766677256, now seen corresponding path program 1 times [2019-09-10 08:36:08,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:08,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:08,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:08,744 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 08:36:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:08,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:36:08,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:08,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:36:08,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:36:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:36:08,746 INFO L87 Difference]: Start difference. First operand 73967 states and 100725 transitions. Second operand 6 states. [2019-09-10 08:36:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:08,999 INFO L93 Difference]: Finished difference Result 110863 states and 150018 transitions. [2019-09-10 08:36:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:36:08,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-09-10 08:36:08,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:09,098 INFO L225 Difference]: With dead ends: 110863 [2019-09-10 08:36:09,098 INFO L226 Difference]: Without dead ends: 110863 [2019-09-10 08:36:09,098 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 08:36:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110863 states. [2019-09-10 08:36:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110863 to 74543. [2019-09-10 08:36:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74543 states. [2019-09-10 08:36:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74543 states to 74543 states and 101109 transitions. [2019-09-10 08:36:09,829 INFO L78 Accepts]: Start accepts. Automaton has 74543 states and 101109 transitions. Word has length 177 [2019-09-10 08:36:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:09,829 INFO L475 AbstractCegarLoop]: Abstraction has 74543 states and 101109 transitions. [2019-09-10 08:36:09,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:36:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 74543 states and 101109 transitions. [2019-09-10 08:36:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 08:36:09,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:09,836 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:09,837 INFO L418 AbstractCegarLoop]: === Iteration 169 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1493704397, now seen corresponding path program 1 times [2019-09-10 08:36:09,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:09,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:09,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:09,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:10,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:10,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:36:10,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:10,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:36:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:36:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:36:10,447 INFO L87 Difference]: Start difference. First operand 74543 states and 101109 transitions. Second operand 3 states. [2019-09-10 08:36:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:10,612 INFO L93 Difference]: Finished difference Result 92609 states and 124078 transitions. [2019-09-10 08:36:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:36:10,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-10 08:36:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:10,689 INFO L225 Difference]: With dead ends: 92609 [2019-09-10 08:36:10,690 INFO L226 Difference]: Without dead ends: 92609 [2019-09-10 08:36:10,690 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 08:36:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92609 states. [2019-09-10 08:36:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92609 to 89407. [2019-09-10 08:36:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89407 states. [2019-09-10 08:36:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89407 states to 89407 states and 120237 transitions. [2019-09-10 08:36:11,420 INFO L78 Accepts]: Start accepts. Automaton has 89407 states and 120237 transitions. Word has length 217 [2019-09-10 08:36:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:11,420 INFO L475 AbstractCegarLoop]: Abstraction has 89407 states and 120237 transitions. [2019-09-10 08:36:11,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:36:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89407 states and 120237 transitions. [2019-09-10 08:36:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:36:11,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:11,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:11,429 INFO L418 AbstractCegarLoop]: === Iteration 170 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1681928588, now seen corresponding path program 1 times [2019-09-10 08:36:11,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:11,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:11,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:36:11,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:36:11,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:36:11,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:11,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:11,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:36:11,784 INFO L87 Difference]: Start difference. First operand 89407 states and 120237 transitions. Second operand 9 states. [2019-09-10 08:36:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:13,336 INFO L93 Difference]: Finished difference Result 628029 states and 843460 transitions. [2019-09-10 08:36:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:36:13,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-10 08:36:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:14,036 INFO L225 Difference]: With dead ends: 628029 [2019-09-10 08:36:14,036 INFO L226 Difference]: Without dead ends: 628029 [2019-09-10 08:36:14,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:36:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628029 states. [2019-09-10 08:36:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628029 to 145471. [2019-09-10 08:36:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145471 states. [2019-09-10 08:36:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145471 states to 145471 states and 194925 transitions. [2019-09-10 08:36:22,683 INFO L78 Accepts]: Start accepts. Automaton has 145471 states and 194925 transitions. Word has length 218 [2019-09-10 08:36:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:22,683 INFO L475 AbstractCegarLoop]: Abstraction has 145471 states and 194925 transitions. [2019-09-10 08:36:22,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 145471 states and 194925 transitions. [2019-09-10 08:36:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:36:22,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:22,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:22,694 INFO L418 AbstractCegarLoop]: === Iteration 171 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -340982626, now seen corresponding path program 1 times [2019-09-10 08:36:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:22,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:22,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:22,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:23,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:23,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:36:23,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2019-09-10 08:36:23,154 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], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [190], [193], [196], [200], [203], [206], [210], [213], [216], [220], [223], [226], [229], [233], [236], [239], [243], [246], [249], [252], [255], [379], [383], [420], [423], [426], [429], [551], [555], [680], [683], [686], [691], [694], [700], [702], [704], [707], [710], [718], [10721], [10724], [10727], [10730], [10831], [10835], [15697], [15700], [15703], [15706], [15784], [15788], [17998], [18000], [18003], [18008], [18011], [18015], [18028], [18030], [18132], [18135], [18138], [18141], [18200], [18204], [19196], [19199], [19200], [19202], [19305], [19308], [19311], [19314], [19356], [19360], [19768], [19872], [19875], [19909], [19911], [20145], [20148], [20152], [20155], [20158], [20162], [20164], [20167], [20170], [20185], [20187], [20189], [20192], [20207], [20209], [20211], [20214], [20229], [20231], [20233], [20236], [20251], [20253], [20255], [20258], [20273], [20275], [20277], [20280], [20295], [20297], [20299], [20301], [20304], [20307], [20315], [20317], [20320], [20323], [20331], [20333], [20336], [20339], [20347], [20349], [20352], [20355], [20363], [20365], [20368], [20371], [20379], [20381], [20384], [20387], [20395], [20465], [20466], [20470], [20471], [20472] [2019-09-10 08:36:23,202 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:36:23,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:36:24,319 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:36:29,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:36:29,642 INFO L272 AbstractInterpreter]: Visited 204 different actions 1382 times. Merged at 74 different actions 1033 times. Widened at 36 different actions 229 times. Performed 6545 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6545 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 126 fixpoints after 28 different actions. Largest state had 1486 variables. [2019-09-10 08:36:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:29,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:36:29,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:29,647 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 08:36:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:29,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:36:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 7695 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:36:30,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:36:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:36:31,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:36:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:36:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:36:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 9] total 25 [2019-09-10 08:36:31,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:31,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:31,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:36:31,524 INFO L87 Difference]: Start difference. First operand 145471 states and 194925 transitions. Second operand 9 states. [2019-09-10 08:36:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:33,182 INFO L93 Difference]: Finished difference Result 676363 states and 907443 transitions. [2019-09-10 08:36:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:36:33,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-10 08:36:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:40,157 INFO L225 Difference]: With dead ends: 676363 [2019-09-10 08:36:40,157 INFO L226 Difference]: Without dead ends: 676363 [2019-09-10 08:36:40,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:36:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676363 states. [2019-09-10 08:36:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676363 to 229311. [2019-09-10 08:36:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229311 states. [2019-09-10 08:36:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229311 states to 229311 states and 306317 transitions. [2019-09-10 08:36:45,080 INFO L78 Accepts]: Start accepts. Automaton has 229311 states and 306317 transitions. Word has length 218 [2019-09-10 08:36:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:45,081 INFO L475 AbstractCegarLoop]: Abstraction has 229311 states and 306317 transitions. [2019-09-10 08:36:45,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:36:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 229311 states and 306317 transitions. [2019-09-10 08:36:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:36:45,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:45,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:36:45,093 INFO L418 AbstractCegarLoop]: === Iteration 172 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1052387724, now seen corresponding path program 1 times [2019-09-10 08:36:45,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:45,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:45,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:45,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:45,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:36:45,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2019-09-10 08:36:45,558 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], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [190], [193], [196], [200], [203], [206], [210], [213], [216], [220], [223], [226], [229], [233], [236], [239], [243], [246], [249], [252], [255], [379], [383], [420], [423], [426], [429], [551], [555], [680], [683], [698], [700], [702], [704], [707], [710], [718], [10721], [10724], [10727], [10730], [10831], [10835], [15697], [15700], [15703], [15706], [15784], [15788], [17998], [18000], [18003], [18008], [18011], [18015], [18028], [18030], [18132], [18135], [18138], [18141], [18200], [18204], [19196], [19199], [19200], [19202], [19305], [19308], [19311], [19314], [19356], [19360], [19768], [19872], [19875], [19909], [19911], [20145], [20148], [20152], [20155], [20158], [20162], [20164], [20167], [20170], [20185], [20187], [20189], [20192], [20207], [20209], [20211], [20214], [20229], [20231], [20233], [20236], [20251], [20253], [20255], [20258], [20273], [20275], [20277], [20280], [20283], [20288], [20291], [20297], [20299], [20301], [20304], [20307], [20315], [20317], [20320], [20323], [20331], [20333], [20336], [20339], [20347], [20349], [20352], [20355], [20363], [20365], [20368], [20371], [20379], [20381], [20384], [20387], [20395], [20465], [20466], [20470], [20471], [20472] [2019-09-10 08:36:45,567 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:36:45,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:36:46,617 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:36:50,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:36:50,391 INFO L272 AbstractInterpreter]: Visited 204 different actions 1418 times. Merged at 74 different actions 1065 times. Widened at 34 different actions 204 times. Performed 6838 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6838 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 129 fixpoints after 26 different actions. Largest state had 1486 variables. [2019-09-10 08:36:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:50,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:36:50,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:50,392 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 08:36:50,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:50,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:36:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:51,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 7695 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:36:51,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:36:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:36:51,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:36:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:36:51,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:36:51,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 18 [2019-09-10 08:36:51,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:36:51,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:36:51,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:36:51,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:36:51,965 INFO L87 Difference]: Start difference. First operand 229311 states and 306317 transitions. Second operand 9 states. [2019-09-10 08:36:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:54,262 INFO L93 Difference]: Finished difference Result 733773 states and 983956 transitions. [2019-09-10 08:36:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:36:54,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-10 08:36:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:55,097 INFO L225 Difference]: With dead ends: 733773 [2019-09-10 08:36:55,097 INFO L226 Difference]: Without dead ends: 733773 [2019-09-10 08:36:55,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:36:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733773 states. [2019-09-10 08:37:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733773 to 285375. [2019-09-10 08:37:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285375 states. [2019-09-10 08:37:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285375 states to 285375 states and 381005 transitions. [2019-09-10 08:37:07,882 INFO L78 Accepts]: Start accepts. Automaton has 285375 states and 381005 transitions. Word has length 218 [2019-09-10 08:37:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:07,882 INFO L475 AbstractCegarLoop]: Abstraction has 285375 states and 381005 transitions. [2019-09-10 08:37:07,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:37:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 285375 states and 381005 transitions. [2019-09-10 08:37:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-10 08:37:07,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:07,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:37:07,895 INFO L418 AbstractCegarLoop]: === Iteration 173 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1248515188, now seen corresponding path program 1 times [2019-09-10 08:37:07,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:07,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:07,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:37:08,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:37:08,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:37:08,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:37:08,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:37:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:37:08,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:37:08,598 INFO L87 Difference]: Start difference. First operand 285375 states and 381005 transitions. Second operand 9 states. [2019-09-10 08:37:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:37:17,877 INFO L93 Difference]: Finished difference Result 791469 states and 1060900 transitions. [2019-09-10 08:37:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:37:17,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-10 08:37:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:37:18,811 INFO L225 Difference]: With dead ends: 791469 [2019-09-10 08:37:18,812 INFO L226 Difference]: Without dead ends: 791469 [2019-09-10 08:37:18,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:37:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791469 states.